./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:57:42,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:57:42,589 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:57:42,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:57:42,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:57:42,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:57:42,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:57:42,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:57:42,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:57:42,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:57:42,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:57:42,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:57:42,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:57:42,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:57:42,642 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:57:42,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:57:42,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:57:42,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:57:42,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:57:42,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:57:42,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:57:42,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:57:42,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:57:42,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:57:42,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:57:42,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:57:42,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:57:42,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:57:42,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:57:42,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:57:42,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:57:42,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:57:42,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:42,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:57:42,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:57:42,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:57:42,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:57:42,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:57:42,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:57:42,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:57:42,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:57:42,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:57:42,661 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-11-08 18:57:42,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:57:42,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:57:42,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:57:42,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:57:42,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:57:42,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i Unable to find full path for "g++" [2024-11-08 18:57:44,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:57:45,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:57:45,113 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-08 18:57:45,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/4da964852/c53f7a1e2fad4499a0f6957a27f6a2cc/FLAG424214cd7 [2024-11-08 18:57:45,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/4da964852/c53f7a1e2fad4499a0f6957a27f6a2cc [2024-11-08 18:57:45,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:57:45,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:57:45,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:45,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:57:45,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:57:45,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a8e61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45, skipping insertion in model container [2024-11-08 18:57:45,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:57:45,706 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_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-08 18:57:45,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:45,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:57:45,805 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_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-08 18:57:45,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:45,885 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:57:45,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45 WrapperNode [2024-11-08 18:57:45,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:45,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:45,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:57:45,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:57:45,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,963 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2024-11-08 18:57:45,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:45,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:57:45,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:57:45,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:57:45,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:45,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,007 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-11-08 18:57:46,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:57:46,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:57:46,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:57:46,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:57:46,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (1/1) ... [2024-11-08 18:57:46,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:46,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:46,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:46,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:57:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:57:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 18:57:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 18:57:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 18:57:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 18:57:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 18:57:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 18:57:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 18:57:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:57:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:57:46,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 18:57:46,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 18:57:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:57:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 18:57:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 18:57:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 18:57:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 18:57:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 18:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:57:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 18:57:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 18:57:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 18:57:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 18:57:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 18:57:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:57:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:57:46,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:57:46,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:57:46,997 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-08 18:57:46,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:57:47,016 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:57:47,016 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:57:47,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:47 BoogieIcfgContainer [2024-11-08 18:57:47,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:57:47,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:57:47,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:57:47,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:57:47,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:57:45" (1/3) ... [2024-11-08 18:57:47,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6543f686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:47, skipping insertion in model container [2024-11-08 18:57:47,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:45" (2/3) ... [2024-11-08 18:57:47,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6543f686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:47, skipping insertion in model container [2024-11-08 18:57:47,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:47" (3/3) ... [2024-11-08 18:57:47,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-11-08 18:57:47,047 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:57:47,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:57:47,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:57:47,124 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;@1214be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:57:47,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:57:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:57:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:47,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:47,150 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:47,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 640794718, now seen corresponding path program 1 times [2024-11-08 18:57:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:47,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890167847] [2024-11-08 18:57:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890167847] [2024-11-08 18:57:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890167847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:57:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390013215] [2024-11-08 18:57:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:57:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:57:47,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:57:47,777 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:57:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:47,824 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-08 18:57:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:57:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-08 18:57:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:47,836 INFO L225 Difference]: With dead ends: 249 [2024-11-08 18:57:47,836 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 18:57:47,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-08 18:57:47,843 INFO L432 NwaCegarLoop]: 183 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, 183 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-08 18:57:47,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:57:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 18:57:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 18:57:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:57:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-08 18:57:47,896 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-08 18:57:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:47,896 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-08 18:57:47,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:57:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-08 18:57:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:47,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:47,901 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:47,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:57:47,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:47,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash 778873788, now seen corresponding path program 1 times [2024-11-08 18:57:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:47,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795294781] [2024-11-08 18:57:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795294781] [2024-11-08 18:57:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795294781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862665024] [2024-11-08 18:57:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:48,393 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:57:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:48,468 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-08 18:57:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-08 18:57:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:48,471 INFO L225 Difference]: With dead ends: 247 [2024-11-08 18:57:48,471 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 18:57:48,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-08 18:57:48,476 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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-08 18:57:48,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:57:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 18:57:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 18:57:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:57:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-08 18:57:48,499 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-08 18:57:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:48,501 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-08 18:57:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:57:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-08 18:57:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:48,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:48,509 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:57:48,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:48,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1402155390, now seen corresponding path program 1 times [2024-11-08 18:57:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891966652] [2024-11-08 18:57:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891966652] [2024-11-08 18:57:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891966652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723302743] [2024-11-08 18:57:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:49,143 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:49,482 INFO L93 Difference]: Finished difference Result 373 states and 550 transitions. [2024-11-08 18:57:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:57:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:49,486 INFO L225 Difference]: With dead ends: 373 [2024-11-08 18:57:49,486 INFO L226 Difference]: Without dead ends: 250 [2024-11-08 18:57:49,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-08 18:57:49,488 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 180 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:49,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 496 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:57:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-08 18:57:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 222. [2024-11-08 18:57:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 177 states have internal predecessors, (243), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:57:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2024-11-08 18:57:49,520 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 168 [2024-11-08 18:57:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:49,521 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2024-11-08 18:57:49,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2024-11-08 18:57:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:49,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:49,525 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:49,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:57:49,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:49,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1268141884, now seen corresponding path program 1 times [2024-11-08 18:57:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575541082] [2024-11-08 18:57:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575541082] [2024-11-08 18:57:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575541082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:57:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91142133] [2024-11-08 18:57:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:57:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:57:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:50,536 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:50,772 INFO L93 Difference]: Finished difference Result 355 states and 524 transitions. [2024-11-08 18:57:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:57:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:57:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:50,777 INFO L225 Difference]: With dead ends: 355 [2024-11-08 18:57:50,777 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 18:57:50,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:57:50,779 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 179 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:50,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 423 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:57:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 18:57:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-08 18:57:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 179 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:57:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 329 transitions. [2024-11-08 18:57:50,829 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 329 transitions. Word has length 168 [2024-11-08 18:57:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:50,830 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 329 transitions. [2024-11-08 18:57:50,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 329 transitions. [2024-11-08 18:57:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:50,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:50,838 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:50,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:57:50,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2015708162, now seen corresponding path program 1 times [2024-11-08 18:57:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600693114] [2024-11-08 18:57:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600693114] [2024-11-08 18:57:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600693114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:51,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:57:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067140158] [2024-11-08 18:57:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:51,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:57:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:57:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:51,449 INFO L87 Difference]: Start difference. First operand 224 states and 329 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:51,650 INFO L93 Difference]: Finished difference Result 463 states and 680 transitions. [2024-11-08 18:57:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:57:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:57:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:51,654 INFO L225 Difference]: With dead ends: 463 [2024-11-08 18:57:51,654 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 18:57:51,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:57:51,656 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:51,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1035 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:57:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 18:57:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 234. [2024-11-08 18:57:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3703703703703705) internal successors, (259), 189 states have internal predecessors, (259), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:57:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2024-11-08 18:57:51,682 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 168 [2024-11-08 18:57:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:51,683 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2024-11-08 18:57:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2024-11-08 18:57:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:57:51,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:51,685 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:51,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:57:51,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:51,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -11721794, now seen corresponding path program 1 times [2024-11-08 18:57:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435398080] [2024-11-08 18:57:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435398080] [2024-11-08 18:57:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435398080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:52,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:57:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062985163] [2024-11-08 18:57:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:57:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:57:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:57:52,618 INFO L87 Difference]: Start difference. First operand 234 states and 343 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:53,018 INFO L93 Difference]: Finished difference Result 494 states and 725 transitions. [2024-11-08 18:57:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:57:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:57:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:53,021 INFO L225 Difference]: With dead ends: 494 [2024-11-08 18:57:53,022 INFO L226 Difference]: Without dead ends: 358 [2024-11-08 18:57:53,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:57:53,023 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 547 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:53,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 492 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:57:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-08 18:57:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 230. [2024-11-08 18:57:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.345945945945946) internal successors, (249), 185 states have internal predecessors, (249), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:57:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2024-11-08 18:57:53,054 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 168 [2024-11-08 18:57:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:53,054 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2024-11-08 18:57:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:57:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2024-11-08 18:57:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:57:53,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:53,058 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:57:53,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1581222057, now seen corresponding path program 1 times [2024-11-08 18:57:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:53,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105527691] [2024-11-08 18:57:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 18:57:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105527691] [2024-11-08 18:57:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105527691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684319798] [2024-11-08 18:57:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:54,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:54,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:54,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:57:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:55,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 18:57:55,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:55,303 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 33 treesize of output 17 [2024-11-08 18:57:55,355 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 33 treesize of output 17 [2024-11-08 18:57:55,405 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 33 treesize of output 17 [2024-11-08 18:57:55,824 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 69 treesize of output 45 [2024-11-08 18:57:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:57:55,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 18:57:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684319798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:56,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-11-08 18:57:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606514156] [2024-11-08 18:57:56,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:57:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:57:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:57:56,392 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 18:57:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:57,406 INFO L93 Difference]: Finished difference Result 517 states and 735 transitions. [2024-11-08 18:57:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:57:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) Word has length 170 [2024-11-08 18:57:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:57,409 INFO L225 Difference]: With dead ends: 517 [2024-11-08 18:57:57,410 INFO L226 Difference]: Without dead ends: 380 [2024-11-08 18:57:57,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 372 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 18:57:57,412 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 703 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:57,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 834 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:57:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-08 18:57:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 242. [2024-11-08 18:57:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.317948717948718) internal successors, (257), 195 states have internal predecessors, (257), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:57:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 341 transitions. [2024-11-08 18:57:57,454 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 341 transitions. Word has length 170 [2024-11-08 18:57:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:57,455 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 341 transitions. [2024-11-08 18:57:57,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 18:57:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 341 transitions. [2024-11-08 18:57:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:57:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:57,459 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:57:57,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:57:57,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:57,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1493594281, now seen corresponding path program 1 times [2024-11-08 18:57:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053061951] [2024-11-08 18:57:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:57:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:57:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:57:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:57:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:57:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:57:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:57:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:57:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:57:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:57:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:57:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:57:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:57:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:57:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:57:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:57:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:57:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:57:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053061951] [2024-11-08 18:57:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053061951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:57:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601448363] [2024-11-08 18:57:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:57:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:57:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:57:59,506 INFO L87 Difference]: Start difference. First operand 242 states and 341 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:00,104 INFO L93 Difference]: Finished difference Result 623 states and 872 transitions. [2024-11-08 18:58:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:58:00,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-08 18:58:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:00,107 INFO L225 Difference]: With dead ends: 623 [2024-11-08 18:58:00,107 INFO L226 Difference]: Without dead ends: 490 [2024-11-08 18:58:00,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:58:00,109 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 303 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:00,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1316 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:58:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-08 18:58:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 401. [2024-11-08 18:58:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 338 states have (on average 1.331360946745562) internal successors, (450), 339 states have internal predecessors, (450), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:58:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 560 transitions. [2024-11-08 18:58:00,191 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 560 transitions. Word has length 170 [2024-11-08 18:58:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:00,192 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 560 transitions. [2024-11-08 18:58:00,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 560 transitions. [2024-11-08 18:58:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:58:00,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:00,195 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:00,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:58:00,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1274739563, now seen corresponding path program 1 times [2024-11-08 18:58:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036510175] [2024-11-08 18:58:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036510175] [2024-11-08 18:58:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036510175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:58:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264363697] [2024-11-08 18:58:00,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:58:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:58:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:58:00,401 INFO L87 Difference]: Start difference. First operand 401 states and 560 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:00,466 INFO L93 Difference]: Finished difference Result 697 states and 976 transitions. [2024-11-08 18:58:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:00,466 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-08 18:58:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:00,471 INFO L225 Difference]: With dead ends: 697 [2024-11-08 18:58:00,471 INFO L226 Difference]: Without dead ends: 402 [2024-11-08 18:58:00,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-08 18:58:00,472 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:00,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:58:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-08 18:58:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-08 18:58:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 339 states have (on average 1.3185840707964602) internal successors, (447), 340 states have internal predecessors, (447), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:58:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 557 transitions. [2024-11-08 18:58:00,520 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 557 transitions. Word has length 170 [2024-11-08 18:58:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:00,521 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 557 transitions. [2024-11-08 18:58:00,521 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 557 transitions. [2024-11-08 18:58:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:58:00,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:00,524 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:00,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:58:00,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:00,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2062566281, now seen corresponding path program 1 times [2024-11-08 18:58:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877195543] [2024-11-08 18:58:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 18:58:01,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877195543] [2024-11-08 18:58:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877195543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:01,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707040123] [2024-11-08 18:58:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:58:01,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:58:01,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:58:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:02,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:58:02,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:02,298 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 33 treesize of output 17 [2024-11-08 18:58:02,346 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 33 treesize of output 17 [2024-11-08 18:58:02,392 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 33 treesize of output 17 [2024-11-08 18:58:02,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 18:58:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:58:02,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 18:58:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707040123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:58:03,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:58:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-08 18:58:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532185847] [2024-11-08 18:58:03,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:58:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:58:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:58:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:58:03,387 INFO L87 Difference]: Start difference. First operand 402 states and 557 transitions. Second operand has 18 states, 15 states have (on average 6.466666666666667) internal successors, (97), 18 states have internal predecessors, (97), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 18:58:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:04,089 INFO L93 Difference]: Finished difference Result 674 states and 932 transitions. [2024-11-08 18:58:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:58:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 6.466666666666667) internal successors, (97), 18 states have internal predecessors, (97), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) Word has length 172 [2024-11-08 18:58:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:04,093 INFO L225 Difference]: With dead ends: 674 [2024-11-08 18:58:04,093 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 18:58:04,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 375 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2024-11-08 18:58:04,095 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 477 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:04,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 960 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:58:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 18:58:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 376. [2024-11-08 18:58:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 313 states have (on average 1.2971246006389776) internal successors, (406), 314 states have internal predecessors, (406), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:58:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 516 transitions. [2024-11-08 18:58:04,144 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 516 transitions. Word has length 172 [2024-11-08 18:58:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:04,144 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 516 transitions. [2024-11-08 18:58:04,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 6.466666666666667) internal successors, (97), 18 states have internal predecessors, (97), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 18:58:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 516 transitions. [2024-11-08 18:58:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:58:04,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:04,149 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:04,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:58:04,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:04,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1974938505, now seen corresponding path program 1 times [2024-11-08 18:58:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916869560] [2024-11-08 18:58:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916869560] [2024-11-08 18:58:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916869560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:05,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:58:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23876227] [2024-11-08 18:58:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:58:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:58:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:58:05,973 INFO L87 Difference]: Start difference. First operand 376 states and 516 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:06,347 INFO L93 Difference]: Finished difference Result 636 states and 876 transitions. [2024-11-08 18:58:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:58:06,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-08 18:58:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:06,351 INFO L225 Difference]: With dead ends: 636 [2024-11-08 18:58:06,352 INFO L226 Difference]: Without dead ends: 382 [2024-11-08 18:58:06,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:58:06,354 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 133 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:06,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1055 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:58:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-08 18:58:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 352. [2024-11-08 18:58:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 289 states have (on average 1.3114186851211074) internal successors, (379), 290 states have internal predecessors, (379), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:58:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-11-08 18:58:06,421 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 172 [2024-11-08 18:58:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:06,421 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-11-08 18:58:06,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-11-08 18:58:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 18:58:06,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:06,425 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:06,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:58:06,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:06,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:06,426 INFO L85 PathProgramCache]: Analyzing trace with hash 435952301, now seen corresponding path program 1 times [2024-11-08 18:58:06,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076667861] [2024-11-08 18:58:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076667861] [2024-11-08 18:58:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076667861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:58:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587843807] [2024-11-08 18:58:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:58:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:58:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:58:08,023 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:08,293 INFO L93 Difference]: Finished difference Result 686 states and 948 transitions. [2024-11-08 18:58:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:58:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2024-11-08 18:58:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:08,296 INFO L225 Difference]: With dead ends: 686 [2024-11-08 18:58:08,296 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 18:58:08,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:58:08,298 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 118 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:08,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1091 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:58:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 18:58:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 402. [2024-11-08 18:58:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 339 states have (on average 1.294985250737463) internal successors, (439), 340 states have internal predecessors, (439), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:58:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 549 transitions. [2024-11-08 18:58:08,344 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 549 transitions. Word has length 175 [2024-11-08 18:58:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:08,345 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 549 transitions. [2024-11-08 18:58:08,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 549 transitions. [2024-11-08 18:58:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:08,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:08,348 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:08,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:58:08,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 275512971, now seen corresponding path program 1 times [2024-11-08 18:58:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680358326] [2024-11-08 18:58:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680358326] [2024-11-08 18:58:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680358326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:09,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:58:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990548942] [2024-11-08 18:58:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:09,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:58:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:58:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:58:09,599 INFO L87 Difference]: Start difference. First operand 402 states and 549 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:10,696 INFO L93 Difference]: Finished difference Result 681 states and 918 transitions. [2024-11-08 18:58:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:58:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-08 18:58:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:10,704 INFO L225 Difference]: With dead ends: 681 [2024-11-08 18:58:10,704 INFO L226 Difference]: Without dead ends: 679 [2024-11-08 18:58:10,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:58:10,706 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 716 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:10,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1471 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:58:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-08 18:58:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 511. [2024-11-08 18:58:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 439 states have (on average 1.275626423690205) internal successors, (560), 440 states have internal predecessors, (560), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-08 18:58:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 686 transitions. [2024-11-08 18:58:10,788 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 686 transitions. Word has length 177 [2024-11-08 18:58:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 686 transitions. [2024-11-08 18:58:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 686 transitions. [2024-11-08 18:58:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:10,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:10,794 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:58:10,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:10,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1647586311, now seen corresponding path program 1 times [2024-11-08 18:58:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183462044] [2024-11-08 18:58:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183462044] [2024-11-08 18:58:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183462044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:58:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382329142] [2024-11-08 18:58:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:11,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:58:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:58:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:58:11,617 INFO L87 Difference]: Start difference. First operand 511 states and 686 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:11,834 INFO L93 Difference]: Finished difference Result 966 states and 1297 transitions. [2024-11-08 18:58:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:58:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-08 18:58:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:11,837 INFO L225 Difference]: With dead ends: 966 [2024-11-08 18:58:11,837 INFO L226 Difference]: Without dead ends: 602 [2024-11-08 18:58:11,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:58:11,839 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 94 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:11,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 613 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:58:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-08 18:58:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-08 18:58:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 513 states have (on average 1.2729044834307992) internal successors, (653), 516 states have internal predecessors, (653), 71 states have call successors, (71), 13 states have call predecessors, (71), 13 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-08 18:58:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 795 transitions. [2024-11-08 18:58:11,908 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 795 transitions. Word has length 177 [2024-11-08 18:58:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:11,909 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 795 transitions. [2024-11-08 18:58:11,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 795 transitions. [2024-11-08 18:58:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:11,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:11,912 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:11,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:58:11,912 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:11,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1946316407, now seen corresponding path program 1 times [2024-11-08 18:58:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747898723] [2024-11-08 18:58:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747898723] [2024-11-08 18:58:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747898723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:58:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394083251] [2024-11-08 18:58:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:58:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:58:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:58:12,691 INFO L87 Difference]: Start difference. First operand 598 states and 795 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:13,010 INFO L93 Difference]: Finished difference Result 1231 states and 1635 transitions. [2024-11-08 18:58:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:58:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-08 18:58:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:13,015 INFO L225 Difference]: With dead ends: 1231 [2024-11-08 18:58:13,015 INFO L226 Difference]: Without dead ends: 784 [2024-11-08 18:58:13,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:58:13,016 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 157 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:13,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 976 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:58:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-08 18:58:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 780. [2024-11-08 18:58:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 679 states have (on average 1.263622974963181) internal successors, (858), 684 states have internal predecessors, (858), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 78 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-08 18:58:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1024 transitions. [2024-11-08 18:58:13,129 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1024 transitions. Word has length 177 [2024-11-08 18:58:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1024 transitions. [2024-11-08 18:58:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1024 transitions. [2024-11-08 18:58:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:13,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:13,131 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:58:13,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1761844875, now seen corresponding path program 1 times [2024-11-08 18:58:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311805688] [2024-11-08 18:58:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311805688] [2024-11-08 18:58:13,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311805688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:13,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:58:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921939136] [2024-11-08 18:58:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:58:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:58:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:58:13,497 INFO L87 Difference]: Start difference. First operand 780 states and 1024 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:13,867 INFO L93 Difference]: Finished difference Result 1651 states and 2183 transitions. [2024-11-08 18:58:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:58:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-08 18:58:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:13,872 INFO L225 Difference]: With dead ends: 1651 [2024-11-08 18:58:13,873 INFO L226 Difference]: Without dead ends: 1044 [2024-11-08 18:58:13,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:58:13,875 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 235 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:13,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 641 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:58:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-08 18:58:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 834. [2024-11-08 18:58:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 733 states have (on average 1.2346521145975444) internal successors, (905), 738 states have internal predecessors, (905), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 78 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-08 18:58:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1071 transitions. [2024-11-08 18:58:13,974 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1071 transitions. Word has length 177 [2024-11-08 18:58:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:13,974 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1071 transitions. [2024-11-08 18:58:13,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1071 transitions. [2024-11-08 18:58:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:13,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:13,976 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:58:13,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash 533274377, now seen corresponding path program 1 times [2024-11-08 18:58:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654669366] [2024-11-08 18:58:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:14,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654669366] [2024-11-08 18:58:14,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654669366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:14,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:14,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:58:14,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475675919] [2024-11-08 18:58:14,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:14,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:58:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:58:14,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:58:14,786 INFO L87 Difference]: Start difference. First operand 834 states and 1071 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:15,025 INFO L93 Difference]: Finished difference Result 1486 states and 1914 transitions. [2024-11-08 18:58:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:58:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-08 18:58:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:15,030 INFO L225 Difference]: With dead ends: 1486 [2024-11-08 18:58:15,030 INFO L226 Difference]: Without dead ends: 849 [2024-11-08 18:58:15,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:58:15,032 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 46 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:15,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 923 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:58:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-08 18:58:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 774. [2024-11-08 18:58:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 683 states have (on average 1.2240117130307466) internal successors, (836), 686 states have internal predecessors, (836), 75 states have call successors, (75), 15 states have call predecessors, (75), 15 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-08 18:58:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 986 transitions. [2024-11-08 18:58:15,114 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 986 transitions. Word has length 177 [2024-11-08 18:58:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:15,115 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 986 transitions. [2024-11-08 18:58:15,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 986 transitions. [2024-11-08 18:58:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:15,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:15,116 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:58:15,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:15,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1838464885, now seen corresponding path program 1 times [2024-11-08 18:58:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582661901] [2024-11-08 18:58:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582661901] [2024-11-08 18:58:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582661901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:58:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295070981] [2024-11-08 18:58:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:58:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:58:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:58:16,146 INFO L87 Difference]: Start difference. First operand 774 states and 986 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:16,454 INFO L93 Difference]: Finished difference Result 1462 states and 1871 transitions. [2024-11-08 18:58:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:58:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-08 18:58:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:16,459 INFO L225 Difference]: With dead ends: 1462 [2024-11-08 18:58:16,459 INFO L226 Difference]: Without dead ends: 885 [2024-11-08 18:58:16,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:58:16,461 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 142 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:16,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1066 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:58:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-08 18:58:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2024-11-08 18:58:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 773 states have (on average 1.222509702457956) internal successors, (945), 778 states have internal predecessors, (945), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 18:58:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1119 transitions. [2024-11-08 18:58:16,562 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1119 transitions. Word has length 177 [2024-11-08 18:58:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:16,563 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1119 transitions. [2024-11-08 18:58:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1119 transitions. [2024-11-08 18:58:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:58:16,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:16,565 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:58:16,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash -452261491, now seen corresponding path program 1 times [2024-11-08 18:58:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781164289] [2024-11-08 18:58:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:58:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:58:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:58:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:58:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:58:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:58:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:58:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:58:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:58:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 18:58:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:58:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:58:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:58:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:58:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:58:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:58:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:58:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781164289] [2024-11-08 18:58:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781164289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:58:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336778954] [2024-11-08 18:58:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:17,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:58:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:58:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:58:17,669 INFO L87 Difference]: Start difference. First operand 881 states and 1119 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:19,084 INFO L93 Difference]: Finished difference Result 1862 states and 2397 transitions. [2024-11-08 18:58:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:58:19,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-08 18:58:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:19,090 INFO L225 Difference]: With dead ends: 1862 [2024-11-08 18:58:19,090 INFO L226 Difference]: Without dead ends: 1182 [2024-11-08 18:58:19,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:58:19,092 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1233 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:19,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1070 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:58:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-08 18:58:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 968. [2024-11-08 18:58:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 836 states have (on average 1.2236842105263157) internal successors, (1023), 841 states have internal predecessors, (1023), 109 states have call successors, (109), 22 states have call predecessors, (109), 22 states have return successors, (109), 104 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-08 18:58:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1241 transitions. [2024-11-08 18:58:19,235 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1241 transitions. Word has length 177 [2024-11-08 18:58:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:19,235 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1241 transitions. [2024-11-08 18:58:19,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1241 transitions. [2024-11-08 18:58:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 18:58:19,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:19,237 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:19,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:58:19,238 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:19,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 521261874, now seen corresponding path program 1 times [2024-11-08 18:58:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294104773] [2024-11-08 18:58:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:58:19,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:58:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:58:19,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:58:19,542 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:58:19,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:58:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:58:19,548 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:19,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:58:19,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:58:19 BoogieIcfgContainer [2024-11-08 18:58:19,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:58:19,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:58:19,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:58:19,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:58:19,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:47" (3/4) ... [2024-11-08 18:58:19,685 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:58:19,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:58:19,687 INFO L158 Benchmark]: Toolchain (without parser) took 34193.81ms. Allocated memory was 148.9MB in the beginning and 830.5MB in the end (delta: 681.6MB). Free memory was 104.8MB in the beginning and 603.0MB in the end (delta: -498.3MB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,687 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 148.9MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:58:19,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.83ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 87.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.83ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 82.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,688 INFO L158 Benchmark]: Boogie Preprocessor took 94.38ms. Allocated memory is still 148.9MB. Free memory was 82.5MB in the beginning and 76.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,688 INFO L158 Benchmark]: RCFGBuilder took 957.52ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 76.5MB in the beginning and 144.6MB in the end (delta: -68.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,689 INFO L158 Benchmark]: TraceAbstraction took 32661.65ms. Allocated memory was 211.8MB in the beginning and 830.5MB in the end (delta: 618.7MB). Free memory was 143.7MB in the beginning and 603.0MB in the end (delta: -459.3MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. [2024-11-08 18:58:19,689 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 830.5MB. Free memory is still 603.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:58:19,691 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.26ms. Allocated memory is still 148.9MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.83ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 87.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.83ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 82.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.38ms. Allocated memory is still 148.9MB. Free memory was 82.5MB in the beginning and 76.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 957.52ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 76.5MB in the beginning and 144.6MB in the end (delta: -68.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32661.65ms. Allocated memory was 211.8MB in the beginning and 830.5MB in the end (delta: 618.7MB). Free memory was 143.7MB in the beginning and 603.0MB in the end (delta: -459.3MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 830.5MB. Free memory is still 603.0MB. 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 50, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_0_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR BOOL_unsigned_char_Array_0[0] [L104] last_1_BOOL_unsigned_char_Array_0_0_ = BOOL_unsigned_char_Array_0[0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] float_Array_0[2] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_short_int_Array_0[0][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] RET updateVariables() [L116] CALL step() [L44] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_0_)) [L47] EXPR signed_short_int_Array_0[1][0] [L47] EXPR signed_short_int_Array_0[0][0] [L47] signed_short_int_Array_0[1][1] = ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]) [L49] EXPR float_Array_0[0] [L49] EXPR float_Array_0[1] [L49] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE (float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2] [L50] EXPR double_Array_0[0] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (double_Array_0[0] - 2.3) > float_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR signed_short_int_Array_0[1][0] [L51] unsigned_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]) [L58] EXPR signed_short_int_Array_0[1][1] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L58] EXPR BOOL_unsigned_char_Array_0[4] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L58] EXPR BOOL_unsigned_char_Array_0[3] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] = (! BOOL_unsigned_char_Array_0[1]) [L63] EXPR BOOL_unsigned_char_Array_0[0] [L63] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR signed_short_int_Array_0[1][0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L107] EXPR BOOL_unsigned_char_Array_0[4] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L107] EXPR BOOL_unsigned_char_Array_0[3] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[1] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) [L107] EXPR float_Array_0[0] [L107] EXPR float_Array_0[1] [L107] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107-L108] return ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 20, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5412 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5406 mSDsluCounter, 15708 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11866 mSDsCounter, 1159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3549 IncrementalHoareTripleChecker+Invalid, 4708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1159 mSolverCounterUnsat, 3842 mSDtfsCounter, 3549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1739 GetRequests, 1549 SyntacticMatches, 12 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=19, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 1253 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 3796 NumberOfCodeBlocks, 3796 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3937 ConstructedInterpolants, 0 QuantifiedInterpolants, 16997 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1147 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 18960/19320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:58:19,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:58:22,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:58:22,086 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:58:22,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:58:22,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:58:22,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:58:22,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:58:22,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:58:22,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:58:22,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:58:22,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:58:22,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:58:22,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:58:22,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:58:22,131 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:58:22,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:58:22,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:58:22,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:58:22,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:58:22,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:58:22,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:58:22,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:58:22,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:58:22,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:58:22,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:58:22,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:58:22,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:58:22,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:58:22,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:58:22,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:58:22,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:58:22,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:58:22,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:58:22,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:58:22,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:58:22,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:58:22,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:58:22,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:58:22,144 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:58:22,144 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:58:22,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:58:22,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:58:22,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:58:22,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:58:22,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-11-08 18:58:22,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:58:22,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:58:22,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:58:22,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:58:22,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:58:22,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i Unable to find full path for "g++" [2024-11-08 18:58:24,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:58:24,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:58:24,871 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-08 18:58:24,884 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/dc362ace3/8deec2cbe5fd4e24b29be48c641095f5/FLAG2f2e2e65b [2024-11-08 18:58:24,902 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/data/dc362ace3/8deec2cbe5fd4e24b29be48c641095f5 [2024-11-08 18:58:24,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:58:24,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:58:24,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:58:24,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:58:24,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:58:24,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:58:24" (1/1) ... [2024-11-08 18:58:24,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a979624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:24, skipping insertion in model container [2024-11-08 18:58:24,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:58:24" (1/1) ... [2024-11-08 18:58:24,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:58:25,132 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_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-08 18:58:25,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:58:25,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:58:25,237 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_724517cd-9d57-4fe2-8baf-f9a798c1bdda/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-08 18:58:25,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:58:25,334 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:58:25,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25 WrapperNode [2024-11-08 18:58:25,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:58:25,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:58:25,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:58:25,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:58:25,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,464 INFO L138 Inliner]: procedures = 39, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 565 [2024-11-08 18:58:25,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:58:25,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:58:25,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:58:25,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:58:25,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,574 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-11-08 18:58:25,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:58:25,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:58:25,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:58:25,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:58:25,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (1/1) ... [2024-11-08 18:58:25,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:58:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:58:25,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:58:25,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:58:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:58:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 18:58:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 18:58:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 18:58:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 18:58:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 18:58:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 18:58:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 18:58:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 18:58:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 18:58:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:58:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:58:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 18:58:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 18:58:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 18:58:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 18:58:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 18:58:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 18:58:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 18:58:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 18:58:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:58:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 18:58:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 18:58:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 18:58:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 18:58:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 18:58:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 18:58:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 18:58:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 18:58:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 18:58:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 18:58:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 18:58:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 18:58:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:58:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 18:58:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 18:58:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 18:58:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 18:58:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 18:58:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 18:58:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 18:58:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 18:58:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-08 18:58:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 18:58:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 18:58:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 18:58:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 18:58:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 18:58:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 18:58:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-08 18:58:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:58:25,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:58:25,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:58:25,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:58:25,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 18:58:25,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 18:58:25,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 18:58:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 18:58:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 18:58:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 18:58:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 18:58:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 18:58:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 18:58:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:58:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:58:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 18:58:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 18:58:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 18:58:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 18:58:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 18:58:25,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:58:25,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:58:30,422 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-08 18:58:30,424 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:58:30,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:58:30,441 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:58:30,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:58:30 BoogieIcfgContainer [2024-11-08 18:58:30,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:58:30,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:58:30,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:58:30,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:58:30,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:58:24" (1/3) ... [2024-11-08 18:58:30,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c66065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:58:30, skipping insertion in model container [2024-11-08 18:58:30,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:58:25" (2/3) ... [2024-11-08 18:58:30,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c66065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:58:30, skipping insertion in model container [2024-11-08 18:58:30,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:58:30" (3/3) ... [2024-11-08 18:58:30,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-11-08 18:58:30,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:58:30,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:58:30,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:58:30,570 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;@1c1a5180, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:58:30,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:58:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:58:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:30,598 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:30,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:30,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 640794718, now seen corresponding path program 1 times [2024-11-08 18:58:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660084341] [2024-11-08 18:58:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:30,625 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-08 18:58:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:30,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:30,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:31,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:58:31,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-08 18:58:31,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:31,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660084341] [2024-11-08 18:58:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660084341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:31,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:31,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:58:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982825966] [2024-11-08 18:58:31,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:31,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:58:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:58:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:58:31,426 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:31,482 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-08 18:58:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:58:31,486 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-08 18:58:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:31,495 INFO L225 Difference]: With dead ends: 249 [2024-11-08 18:58:31,496 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 18:58:31,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-08 18:58:31,505 INFO L432 NwaCegarLoop]: 183 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, 183 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-08 18:58:31,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:58:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 18:58:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 18:58:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:58:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-08 18:58:31,568 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-08 18:58:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-08 18:58:31,569 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-08 18:58:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:31,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:31,575 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:31,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:31,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:31,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 778873788, now seen corresponding path program 1 times [2024-11-08 18:58:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726165037] [2024-11-08 18:58:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:31,780 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-08 18:58:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:31,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:31,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:32,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:58:32,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-08 18:58:32,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:32,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726165037] [2024-11-08 18:58:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726165037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:32,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:58:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474780581] [2024-11-08 18:58:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:32,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:58:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:58:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:58:32,447 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:32,531 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-08 18:58:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-08 18:58:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:32,534 INFO L225 Difference]: With dead ends: 247 [2024-11-08 18:58:32,534 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 18:58:32,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 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-08 18:58:32,536 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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-08 18:58:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:58:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 18:58:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 18:58:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 18:58:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-08 18:58:32,551 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-08 18:58:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:32,552 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-08 18:58:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-08 18:58:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:32,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:32,556 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:32,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:32,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:32,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1402155390, now seen corresponding path program 1 times [2024-11-08 18:58:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394390927] [2024-11-08 18:58:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:32,760 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-08 18:58:32,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:32,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:32,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:33,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:58:33,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:33,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 18:58:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:34,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:34,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394390927] [2024-11-08 18:58:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394390927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:34,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:58:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970374265] [2024-11-08 18:58:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:58:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:34,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:58:34,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:58:34,089 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:34,451 INFO L93 Difference]: Finished difference Result 388 states and 574 transitions. [2024-11-08 18:58:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:58:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:34,455 INFO L225 Difference]: With dead ends: 388 [2024-11-08 18:58:34,456 INFO L226 Difference]: Without dead ends: 265 [2024-11-08 18:58:34,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-08 18:58:34,458 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 201 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:34,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 514 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:58:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-08 18:58:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 222. [2024-11-08 18:58:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 177 states have internal predecessors, (243), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:58:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2024-11-08 18:58:34,514 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 168 [2024-11-08 18:58:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:34,515 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2024-11-08 18:58:34,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2024-11-08 18:58:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:34,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:34,522 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:34,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:58:34,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:34,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:34,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1268141884, now seen corresponding path program 1 times [2024-11-08 18:58:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:34,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100502306] [2024-11-08 18:58:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:34,725 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-08 18:58:34,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:34,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:34,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:35,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:58:35,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:35,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:35,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100502306] [2024-11-08 18:58:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100502306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:58:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453468625] [2024-11-08 18:58:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:58:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:58:35,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:58:35,342 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:35,509 INFO L93 Difference]: Finished difference Result 371 states and 551 transitions. [2024-11-08 18:58:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:35,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:58:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:35,512 INFO L225 Difference]: With dead ends: 371 [2024-11-08 18:58:35,512 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 18:58:35,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-08 18:58:35,514 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:35,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 509 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:58:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 18:58:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-08 18:58:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 179 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:58:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 329 transitions. [2024-11-08 18:58:35,534 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 329 transitions. Word has length 168 [2024-11-08 18:58:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:35,535 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 329 transitions. [2024-11-08 18:58:35,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 329 transitions. [2024-11-08 18:58:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:35,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:35,538 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:35,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-08 18:58:35,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:35,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2015708162, now seen corresponding path program 1 times [2024-11-08 18:58:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388365670] [2024-11-08 18:58:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:35,741 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-08 18:58:35,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:35,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:35,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:36,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:58:36,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:36,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 18:58:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:36,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:36,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388365670] [2024-11-08 18:58:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388365670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:36,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:36,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:58:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131011795] [2024-11-08 18:58:36,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:36,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:58:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:58:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:58:36,413 INFO L87 Difference]: Start difference. First operand 224 states and 329 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:41,616 INFO L93 Difference]: Finished difference Result 488 states and 719 transitions. [2024-11-08 18:58:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:58:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:58:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:41,622 INFO L225 Difference]: With dead ends: 488 [2024-11-08 18:58:41,622 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 18:58:41,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:58:41,624 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:41,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1035 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-08 18:58:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 18:58:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 234. [2024-11-08 18:58:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3703703703703705) internal successors, (259), 189 states have internal predecessors, (259), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:58:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2024-11-08 18:58:41,645 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 168 [2024-11-08 18:58:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:41,646 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2024-11-08 18:58:41,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2024-11-08 18:58:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 18:58:41,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:41,650 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:41,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:41,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -11721794, now seen corresponding path program 1 times [2024-11-08 18:58:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916544723] [2024-11-08 18:58:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:41,854 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-08 18:58:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:41,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:41,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:42,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:58:42,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:58:42,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:42,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916544723] [2024-11-08 18:58:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916544723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:58:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8749041] [2024-11-08 18:58:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:58:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:58:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:58:42,483 INFO L87 Difference]: Start difference. First operand 234 states and 343 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:43,210 INFO L93 Difference]: Finished difference Result 526 states and 775 transitions. [2024-11-08 18:58:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:58:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-08 18:58:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:43,213 INFO L225 Difference]: With dead ends: 526 [2024-11-08 18:58:43,213 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 18:58:43,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:58:43,215 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 169 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:43,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 694 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:58:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 18:58:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 230. [2024-11-08 18:58:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.335135135135135) internal successors, (247), 185 states have internal predecessors, (247), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:58:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 331 transitions. [2024-11-08 18:58:43,236 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 331 transitions. Word has length 168 [2024-11-08 18:58:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:43,237 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 331 transitions. [2024-11-08 18:58:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:58:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 331 transitions. [2024-11-08 18:58:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:58:43,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:43,240 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:43,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 18:58:43,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:43,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:43,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1581222057, now seen corresponding path program 1 times [2024-11-08 18:58:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032484809] [2024-11-08 18:58:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:43,442 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-08 18:58:43,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:43,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:43,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:43,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:58:43,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:44,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:58:44,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-08 18:58:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 18:58:44,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:44,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032484809] [2024-11-08 18:58:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032484809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:58:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418786901] [2024-11-08 18:58:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:58:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:58:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:58:44,435 INFO L87 Difference]: Start difference. First operand 230 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:49,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:50,445 INFO L93 Difference]: Finished difference Result 436 states and 627 transitions. [2024-11-08 18:58:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:58:50,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-08 18:58:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:50,456 INFO L225 Difference]: With dead ends: 436 [2024-11-08 18:58:50,457 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 18:58:50,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:58:50,458 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 150 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:50,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 570 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 18:58:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 18:58:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-08 18:58:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3243243243243243) internal successors, (245), 185 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:58:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 329 transitions. [2024-11-08 18:58:50,475 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 329 transitions. Word has length 170 [2024-11-08 18:58:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:50,476 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 329 transitions. [2024-11-08 18:58:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 18:58:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 329 transitions. [2024-11-08 18:58:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:58:50,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:50,480 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:58:50,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:50,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1638083651, now seen corresponding path program 1 times [2024-11-08 18:58:50,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:50,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604607178] [2024-11-08 18:58:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:50,682 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-08 18:58:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:50,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:50,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:58:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:51,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:58:51,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:51,340 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-08 18:58:51,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-08 18:58:52,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:58:52,185 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 47 treesize of output 43 [2024-11-08 18:58:52,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:58:52,865 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 57 treesize of output 56 [2024-11-08 18:58:57,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:58:57,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 108 treesize of output 87 [2024-11-08 18:58:57,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:58:57,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 42 [2024-11-08 18:58:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 298 proven. 114 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-08 18:58:57,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-08 18:58:58,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604607178] [2024-11-08 18:58:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604607178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:58:58,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:58:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 20 [2024-11-08 18:58:58,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868624406] [2024-11-08 18:58:58,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:58:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:58:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:58,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:58:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:58:58,615 INFO L87 Difference]: Start difference. First operand 230 states and 329 transitions. Second operand has 20 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-08 18:59:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:03,280 INFO L93 Difference]: Finished difference Result 598 states and 817 transitions. [2024-11-08 18:59:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 18:59:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) Word has length 172 [2024-11-08 18:59:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:03,284 INFO L225 Difference]: With dead ends: 598 [2024-11-08 18:59:03,284 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 18:59:03,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=633, Invalid=2229, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 18:59:03,286 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 305 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:03,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1079 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 18:59:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 18:59:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 266. [2024-11-08 18:59:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 213 states have internal predecessors, (273), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:59:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2024-11-08 18:59:03,325 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 172 [2024-11-08 18:59:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:03,326 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2024-11-08 18:59:03,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-08 18:59:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2024-11-08 18:59:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:59:03,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:03,329 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:03,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:03,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1550455875, now seen corresponding path program 1 times [2024-11-08 18:59:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279127556] [2024-11-08 18:59:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:03,532 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-08 18:59:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:03,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:03,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:04,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 18:59:04,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:04,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:59:04,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-08 18:59:05,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:05,229 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 56 treesize of output 46 [2024-11-08 18:59:06,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:06,225 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 63 treesize of output 58 [2024-11-08 18:59:06,533 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 17 treesize of output 13 [2024-11-08 18:59:06,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2024-11-08 18:59:07,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:07,795 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 141 treesize of output 71 [2024-11-08 18:59:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 452 proven. 39 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-08 18:59:08,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:09,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:09,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279127556] [2024-11-08 18:59:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279127556] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:59:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 28 [2024-11-08 18:59:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676238035] [2024-11-08 18:59:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:59:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:59:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:59:09,194 INFO L87 Difference]: Start difference. First operand 266 states and 357 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:16,934 INFO L93 Difference]: Finished difference Result 543 states and 727 transitions. [2024-11-08 18:59:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:59:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-08 18:59:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:16,939 INFO L225 Difference]: With dead ends: 543 [2024-11-08 18:59:16,939 INFO L226 Difference]: Without dead ends: 368 [2024-11-08 18:59:16,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2024-11-08 18:59:16,940 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 358 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:16,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1355 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-08 18:59:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-08 18:59:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-11-08 18:59:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 292 states have (on average 1.2808219178082192) internal successors, (374), 293 states have internal predecessors, (374), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 484 transitions. [2024-11-08 18:59:17,005 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 484 transitions. Word has length 172 [2024-11-08 18:59:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 484 transitions. [2024-11-08 18:59:17,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 484 transitions. [2024-11-08 18:59:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 18:59:17,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:17,008 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:17,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 18:59:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:17,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1254592007, now seen corresponding path program 1 times [2024-11-08 18:59:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:17,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548617180] [2024-11-08 18:59:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:17,210 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-08 18:59:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:17,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:17,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 18:59:17,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:17,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 18:59:18,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-08 18:59:18,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-08 18:59:19,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:19,176 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 35 treesize of output 37 [2024-11-08 18:59:23,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:23,053 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 86 treesize of output 68 [2024-11-08 18:59:23,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:23,947 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 173 treesize of output 99 [2024-11-08 18:59:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 298 proven. 114 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-08 18:59:24,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:25,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548617180] [2024-11-08 18:59:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548617180] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:59:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2024-11-08 18:59:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161849956] [2024-11-08 18:59:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:59:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:59:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:59:25,259 INFO L87 Difference]: Start difference. First operand 364 states and 484 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:25,737 INFO L93 Difference]: Finished difference Result 709 states and 948 transitions. [2024-11-08 18:59:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:59:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-08 18:59:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:25,742 INFO L225 Difference]: With dead ends: 709 [2024-11-08 18:59:25,742 INFO L226 Difference]: Without dead ends: 440 [2024-11-08 18:59:25,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:59:25,744 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 39 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:25,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 818 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:59:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-08 18:59:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 398. [2024-11-08 18:59:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 327 states have internal predecessors, (416), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 526 transitions. [2024-11-08 18:59:25,798 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 526 transitions. Word has length 177 [2024-11-08 18:59:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 526 transitions. [2024-11-08 18:59:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 526 transitions. [2024-11-08 18:59:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:25,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:25,801 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:25,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:26,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:26,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1009255269, now seen corresponding path program 1 times [2024-11-08 18:59:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:26,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32153779] [2024-11-08 18:59:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:26,004 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-08 18:59:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:26,005 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:26,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:26,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 18:59:26,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:26,778 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 17 treesize of output 13 [2024-11-08 18:59:26,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-08 18:59:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:27,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:59:27,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32153779] [2024-11-08 18:59:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32153779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:59:27,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:59:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:59:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089419143] [2024-11-08 18:59:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:59:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:59:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:59:27,064 INFO L87 Difference]: Start difference. First operand 398 states and 526 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:31,130 INFO L93 Difference]: Finished difference Result 677 states and 889 transitions. [2024-11-08 18:59:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:59:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 18:59:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:31,134 INFO L225 Difference]: With dead ends: 677 [2024-11-08 18:59:31,134 INFO L226 Difference]: Without dead ends: 675 [2024-11-08 18:59:31,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 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-08 18:59:31,135 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 117 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:31,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1316 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 18:59:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-08 18:59:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 489. [2024-11-08 18:59:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 417 states have (on average 1.2805755395683454) internal successors, (534), 418 states have internal predecessors, (534), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 644 transitions. [2024-11-08 18:59:31,195 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 644 transitions. Word has length 179 [2024-11-08 18:59:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:31,196 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 644 transitions. [2024-11-08 18:59:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 644 transitions. [2024-11-08 18:59:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:31,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:31,198 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:31,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:31,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:31,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1913638687, now seen corresponding path program 1 times [2024-11-08 18:59:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:31,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004429941] [2024-11-08 18:59:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:31,400 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-08 18:59:31,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:31,401 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:31,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:31,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 18:59:31,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:32,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:59:32,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004429941] [2024-11-08 18:59:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004429941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:59:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:59:32,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:59:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840496084] [2024-11-08 18:59:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:32,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:59:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:59:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:59:32,190 INFO L87 Difference]: Start difference. First operand 489 states and 644 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:33,275 INFO L93 Difference]: Finished difference Result 1184 states and 1575 transitions. [2024-11-08 18:59:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:59:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 18:59:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:33,280 INFO L225 Difference]: With dead ends: 1184 [2024-11-08 18:59:33,280 INFO L226 Difference]: Without dead ends: 790 [2024-11-08 18:59:33,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:59:33,282 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 158 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:33,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1018 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:59:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-08 18:59:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 535. [2024-11-08 18:59:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 463 states have (on average 1.287257019438445) internal successors, (596), 464 states have internal predecessors, (596), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 706 transitions. [2024-11-08 18:59:33,353 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 706 transitions. Word has length 179 [2024-11-08 18:59:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:33,356 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 706 transitions. [2024-11-08 18:59:33,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 706 transitions. [2024-11-08 18:59:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:33,358 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:33,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-08 18:59:33,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:33,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1233580317, now seen corresponding path program 1 times [2024-11-08 18:59:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187648327] [2024-11-08 18:59:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:33,560 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-08 18:59:33,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:33,561 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:33,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:34,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:59:34,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:34,187 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-08 18:59:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 18:59:35,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:35,911 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 48 treesize of output 33 [2024-11-08 18:59:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 18:59:36,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:36,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187648327] [2024-11-08 18:59:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187648327] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:59:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-08 18:59:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832433592] [2024-11-08 18:59:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:36,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:59:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:59:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:59:36,779 INFO L87 Difference]: Start difference. First operand 535 states and 706 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:37,122 INFO L93 Difference]: Finished difference Result 1082 states and 1421 transitions. [2024-11-08 18:59:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:59:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 18:59:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:37,127 INFO L225 Difference]: With dead ends: 1082 [2024-11-08 18:59:37,128 INFO L226 Difference]: Without dead ends: 642 [2024-11-08 18:59:37,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:59:37,131 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 94 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:37,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 480 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:59:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-08 18:59:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 538. [2024-11-08 18:59:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 466 states have (on average 1.2854077253218885) internal successors, (599), 467 states have internal predecessors, (599), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 709 transitions. [2024-11-08 18:59:37,201 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 709 transitions. Word has length 179 [2024-11-08 18:59:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:37,202 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 709 transitions. [2024-11-08 18:59:37,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 709 transitions. [2024-11-08 18:59:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:37,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:37,205 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:37,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-08 18:59:37,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:37,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -532515739, now seen corresponding path program 1 times [2024-11-08 18:59:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576705618] [2024-11-08 18:59:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:37,408 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-08 18:59:37,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:37,412 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:37,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 18:59:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:38,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:59:38,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:38,150 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-08 18:59:39,026 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 38 treesize of output 20 [2024-11-08 18:59:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 398 proven. 39 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-08 18:59:39,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:39,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576705618] [2024-11-08 18:59:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576705618] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:39,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:59:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2024-11-08 18:59:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812732117] [2024-11-08 18:59:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:39,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:59:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:39,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:59:39,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:59:39,785 INFO L87 Difference]: Start difference. First operand 538 states and 709 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:40,448 INFO L93 Difference]: Finished difference Result 1250 states and 1646 transitions. [2024-11-08 18:59:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:59:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 18:59:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:40,453 INFO L225 Difference]: With dead ends: 1250 [2024-11-08 18:59:40,454 INFO L226 Difference]: Without dead ends: 807 [2024-11-08 18:59:40,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:59:40,456 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 117 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:40,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 835 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:59:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-08 18:59:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 666. [2024-11-08 18:59:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 594 states have (on average 1.2811447811447811) internal successors, (761), 595 states have internal predecessors, (761), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 871 transitions. [2024-11-08 18:59:40,528 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 871 transitions. Word has length 179 [2024-11-08 18:59:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:40,528 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 871 transitions. [2024-11-08 18:59:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 871 transitions. [2024-11-08 18:59:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:40,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:40,529 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:40,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-08 18:59:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:40,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1119321753, now seen corresponding path program 1 times [2024-11-08 18:59:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884595338] [2024-11-08 18:59:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:40,731 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-08 18:59:40,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:40,733 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:40,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-08 18:59:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:41,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:59:41,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 18:59:41,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:59:41,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884595338] [2024-11-08 18:59:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884595338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:59:41,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:59:41,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:59:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865217066] [2024-11-08 18:59:41,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:59:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:59:41,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:59:41,565 INFO L87 Difference]: Start difference. First operand 666 states and 871 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:43,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:47,973 INFO L93 Difference]: Finished difference Result 1775 states and 2318 transitions. [2024-11-08 18:59:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:59:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 18:59:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:47,979 INFO L225 Difference]: With dead ends: 1775 [2024-11-08 18:59:47,980 INFO L226 Difference]: Without dead ends: 1204 [2024-11-08 18:59:47,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 175 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-08 18:59:47,982 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:47,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 848 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 18:59:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-08 18:59:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 945. [2024-11-08 18:59:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 873 states have (on average 1.2646048109965635) internal successors, (1104), 874 states have internal predecessors, (1104), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1214 transitions. [2024-11-08 18:59:48,083 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1214 transitions. Word has length 179 [2024-11-08 18:59:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:48,085 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1214 transitions. [2024-11-08 18:59:48,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 18:59:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1214 transitions. [2024-11-08 18:59:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:48,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:48,088 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:48,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-08 18:59:48,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:48,288 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:48,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash 13581283, now seen corresponding path program 1 times [2024-11-08 18:59:48,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673236966] [2024-11-08 18:59:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:48,290 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-08 18:59:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:48,294 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:48,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 18:59:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:48,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 18:59:48,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:48,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 18:59:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-08 18:59:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-08 18:59:50,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:50,102 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 62 treesize of output 37 [2024-11-08 18:59:53,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:53,358 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 55 treesize of output 45 [2024-11-08 18:59:53,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:59:53,551 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 74 treesize of output 38 [2024-11-08 18:59:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 178 proven. 114 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 18:59:53,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-08 18:59:54,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673236966] [2024-11-08 18:59:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673236966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:59:54,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:59:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-11-08 18:59:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104114161] [2024-11-08 18:59:54,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:59:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:59:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:59:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:59:54,981 INFO L87 Difference]: Start difference. First operand 945 states and 1214 transitions. Second operand has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-08 18:59:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:58,651 INFO L93 Difference]: Finished difference Result 1607 states and 2056 transitions. [2024-11-08 18:59:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 18:59:58,652 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) Word has length 179 [2024-11-08 18:59:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:58,655 INFO L225 Difference]: With dead ends: 1607 [2024-11-08 18:59:58,655 INFO L226 Difference]: Without dead ends: 757 [2024-11-08 18:59:58,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 18:59:58,658 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 356 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:58,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1247 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 18:59:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-08 18:59:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 739. [2024-11-08 18:59:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 667 states have (on average 1.2278860569715142) internal successors, (819), 668 states have internal predecessors, (819), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 18:59:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 929 transitions. [2024-11-08 18:59:58,752 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 929 transitions. Word has length 179 [2024-11-08 18:59:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:58,753 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 929 transitions. [2024-11-08 18:59:58,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 20 states have internal predecessors, (140), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-08 18:59:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 929 transitions. [2024-11-08 18:59:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 18:59:58,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:58,755 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:59:58,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-08 18:59:58,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:58,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1267016675, now seen corresponding path program 1 times [2024-11-08 18:59:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:58,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037539414] [2024-11-08 18:59:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:58,957 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-08 18:59:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:58,958 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:59:58,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 18:59:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:59,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:59:59,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:59,632 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-08 18:59:59,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 19:00:01,275 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 57 treesize of output 41 [2024-11-08 19:00:01,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:00:01,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:00:01,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 73 [2024-11-08 19:00:01,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-08 19:00:02,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:00:02,070 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 87 treesize of output 43 [2024-11-08 19:00:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 19:00:02,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:00:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 19:00:02,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:00:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037539414] [2024-11-08 19:00:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037539414] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:00:02,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:00:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-08 19:00:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411168142] [2024-11-08 19:00:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:00:02,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:00:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:00:02,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:00:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:00:02,624 INFO L87 Difference]: Start difference. First operand 739 states and 929 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:02,954 INFO L93 Difference]: Finished difference Result 1499 states and 1882 transitions. [2024-11-08 19:00:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:00:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 19:00:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:02,957 INFO L225 Difference]: With dead ends: 1499 [2024-11-08 19:00:02,958 INFO L226 Difference]: Without dead ends: 855 [2024-11-08 19:00:02,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:00:02,959 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 88 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:02,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 588 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:00:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-08 19:00:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 745. [2024-11-08 19:00:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 673 states have (on average 1.2258543833580982) internal successors, (825), 674 states have internal predecessors, (825), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 19:00:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 935 transitions. [2024-11-08 19:00:03,038 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 935 transitions. Word has length 179 [2024-11-08 19:00:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:03,038 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 935 transitions. [2024-11-08 19:00:03,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 935 transitions. [2024-11-08 19:00:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 19:00:03,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:03,040 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:00:03,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-08 19:00:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:03,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1104722587, now seen corresponding path program 1 times [2024-11-08 19:00:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:00:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571872247] [2024-11-08 19:00:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:03,244 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-08 19:00:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:00:03,247 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:03,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-08 19:00:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:03,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 19:00:03,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:03,959 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-08 19:00:04,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2024-11-08 19:00:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:00:04,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2024-11-08 19:00:04,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-08 19:00:05,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:00:05,274 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 67 treesize of output 35 [2024-11-08 19:00:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 398 proven. 39 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-08 19:00:05,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:00:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 19:00:05,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:00:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571872247] [2024-11-08 19:00:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571872247] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:00:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:00:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 14 [2024-11-08 19:00:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213748063] [2024-11-08 19:00:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:00:05,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:00:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:00:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:00:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:00:05,774 INFO L87 Difference]: Start difference. First operand 745 states and 935 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:06,306 INFO L93 Difference]: Finished difference Result 1590 states and 1976 transitions. [2024-11-08 19:00:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:00:06,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 19:00:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:06,309 INFO L225 Difference]: With dead ends: 1590 [2024-11-08 19:00:06,309 INFO L226 Difference]: Without dead ends: 907 [2024-11-08 19:00:06,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:00:06,310 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 142 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:06,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 886 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:00:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-08 19:00:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 763. [2024-11-08 19:00:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 691 states have (on average 1.211287988422576) internal successors, (837), 692 states have internal predecessors, (837), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 19:00:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 947 transitions. [2024-11-08 19:00:06,390 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 947 transitions. Word has length 179 [2024-11-08 19:00:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 947 transitions. [2024-11-08 19:00:06,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 947 transitions. [2024-11-08 19:00:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 19:00:06,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:06,392 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:00:06,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-08 19:00:06,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:06,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 266881641, now seen corresponding path program 1 times [2024-11-08 19:00:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:00:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344802445] [2024-11-08 19:00:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:06,594 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-08 19:00:06,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:00:06,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:06,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-08 19:00:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:07,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:00:07,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 19:00:07,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:00:07,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:00:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344802445] [2024-11-08 19:00:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344802445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:00:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:00:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:00:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277384960] [2024-11-08 19:00:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:00:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:00:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:00:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:00:07,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:00:07,123 INFO L87 Difference]: Start difference. First operand 763 states and 947 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:07,227 INFO L93 Difference]: Finished difference Result 1293 states and 1611 transitions. [2024-11-08 19:00:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:00:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 19:00:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:07,231 INFO L225 Difference]: With dead ends: 1293 [2024-11-08 19:00:07,231 INFO L226 Difference]: Without dead ends: 625 [2024-11-08 19:00:07,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 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-08 19:00:07,233 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:07,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:00:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-08 19:00:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2024-11-08 19:00:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 553 states have (on average 1.2025316455696202) internal successors, (665), 554 states have internal predecessors, (665), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 19:00:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 775 transitions. [2024-11-08 19:00:07,315 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 775 transitions. Word has length 179 [2024-11-08 19:00:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 775 transitions. [2024-11-08 19:00:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 775 transitions. [2024-11-08 19:00:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 19:00:07,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:07,317 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:00:07,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-08 19:00:07,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:07,518 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:07,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash 281480807, now seen corresponding path program 1 times [2024-11-08 19:00:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:00:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943350433] [2024-11-08 19:00:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:07,519 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-08 19:00:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:00:07,520 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:07,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-08 19:00:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:08,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:00:08,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 19:00:08,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:00:08,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:00:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943350433] [2024-11-08 19:00:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943350433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:00:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:00:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:00:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931788007] [2024-11-08 19:00:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:00:08,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:00:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:00:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:00:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:00:08,312 INFO L87 Difference]: Start difference. First operand 625 states and 775 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:14,650 INFO L93 Difference]: Finished difference Result 1372 states and 1705 transitions. [2024-11-08 19:00:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:00:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-08 19:00:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:14,653 INFO L225 Difference]: With dead ends: 1372 [2024-11-08 19:00:14,653 INFO L226 Difference]: Without dead ends: 842 [2024-11-08 19:00:14,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:00:14,655 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 135 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:14,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 658 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 19:00:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-08 19:00:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 616. [2024-11-08 19:00:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 544 states have (on average 1.1893382352941178) internal successors, (647), 545 states have internal predecessors, (647), 55 states have call successors, (55), 16 states have call predecessors, (55), 16 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 19:00:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 757 transitions. [2024-11-08 19:00:14,743 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 757 transitions. Word has length 179 [2024-11-08 19:00:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:14,743 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 757 transitions. [2024-11-08 19:00:14,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 19:00:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 757 transitions. [2024-11-08 19:00:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 19:00:14,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:14,745 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:00:14,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-08 19:00:14,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:14,946 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1792436632, now seen corresponding path program 1 times [2024-11-08 19:00:14,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:00:14,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798917384] [2024-11-08 19:00:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:14,947 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-08 19:00:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:00:14,948 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 19:00:14,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724517cd-9d57-4fe2-8baf-f9a798c1bdda/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process