./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:30:13,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:13,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:13,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:13,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:13,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:13,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:13,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:13,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:13,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:13,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:13,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:13,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:13,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:13,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:13,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:13,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:13,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:13,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:13,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:13,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:13,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:13,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:13,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:13,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:13,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:13,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:13,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:13,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:13,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:13,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:13,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:13,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:13,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:13,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:13,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:13,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:13,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:13,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:13,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:13,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:13,461 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:30:13,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:13,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:13,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:13,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:13,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:13,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:13,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:13,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:13,494 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:13,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:13,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:13,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:13,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:13,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:13,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:13,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:13,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:13,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:13,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:13,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:13,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:13,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:13,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:13,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:13,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:13,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:13,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:13,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:13,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:13,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:13,508 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:13,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:13,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:13,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/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_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-11-20 10:30:13,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:13,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:13,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:13,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:13,793 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:13,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-11-20 10:30:16,853 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:17,105 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:17,106 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c [2022-11-20 10:30:17,112 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/0a0a09d85/071f14c329e64463b65e7af2008eb3a4/FLAG9376d8abc [2022-11-20 10:30:17,126 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/0a0a09d85/071f14c329e64463b65e7af2008eb3a4 [2022-11-20 10:30:17,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:17,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:17,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:17,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:17,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:17,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704a7ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17, skipping insertion in model container [2022-11-20 10:30:17,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:17,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:17,410 WARN L237 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_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-20 10:30:17,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:17,467 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:17,487 WARN L237 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_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-20 10:30:17,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:17,533 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:17,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17 WrapperNode [2022-11-20 10:30:17,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:17,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:17,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:17,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:17,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,602 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-20 10:30:17,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:17,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:17,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:17,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:17,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:17,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:17,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:17,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:17,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (1/1) ... [2022-11-20 10:30:17,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:17,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:17,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:17,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:30:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:30:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:30:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:17,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:30:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:30:17,823 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:17,825 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:18,032 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:18,039 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:18,039 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 10:30:18,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:18 BoogieIcfgContainer [2022-11-20 10:30:18,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:18,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:18,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:18,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:18,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:17" (1/3) ... [2022-11-20 10:30:18,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252a5f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:18, skipping insertion in model container [2022-11-20 10:30:18,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:17" (2/3) ... [2022-11-20 10:30:18,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252a5f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:18, skipping insertion in model container [2022-11-20 10:30:18,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:18" (3/3) ... [2022-11-20 10:30:18,053 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-11-20 10:30:18,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:18,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:30:18,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:18,137 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@248d0411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:18,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:30:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:30:18,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:18,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:18,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-20 10:30:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:18,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623286270] [2022-11-20 10:30:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623286270] [2022-11-20 10:30:18,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623286270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:18,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:18,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:30:18,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550784156] [2022-11-20 10:30:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:30:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:30:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:30:18,478 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:18,493 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-20 10:30:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:30:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:30:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:18,504 INFO L225 Difference]: With dead ends: 40 [2022-11-20 10:30:18,504 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 10:30:18,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:30:18,511 INFO L413 NwaCegarLoop]: 26 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, 26 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 [2022-11-20 10:30:18,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:30:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 10:30:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 10:30:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-20 10:30:18,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-20 10:30:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:18,550 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-20 10:30:18,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-20 10:30:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:30:18,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:18,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:18,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:18,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-20 10:30:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108951652] [2022-11-20 10:30:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108951652] [2022-11-20 10:30:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108951652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:18,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:30:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406004138] [2022-11-20 10:30:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:18,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:18,808 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:18,901 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-20 10:30:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:30:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:30:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:18,903 INFO L225 Difference]: With dead ends: 36 [2022-11-20 10:30:18,904 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 10:30:18,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:18,906 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:18,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:30:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 10:30:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-20 10:30:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-20 10:30:18,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-20 10:30:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:18,914 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-20 10:30:18,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-20 10:30:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:30:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:18,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:18,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:18,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-20 10:30:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:18,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196197554] [2022-11-20 10:30:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:20,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196197554] [2022-11-20 10:30:20,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196197554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:20,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008513367] [2022-11-20 10:30:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:20,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:20,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:30:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:20,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 10:30:20,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:20,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:30:20,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:30:20,716 INFO L350 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 14 treesize of output 16 [2022-11-20 10:30:20,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 23 [2022-11-20 10:30:21,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 23 [2022-11-20 10:30:21,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 27 [2022-11-20 10:30:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:21,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:21,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:21,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2022-11-20 10:30:21,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:21,875 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2022-11-20 10:30:21,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:21,884 INFO L350 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 46 treesize of output 34 [2022-11-20 10:30:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008513367] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:21,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:21,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-11-20 10:30:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232018436] [2022-11-20 10:30:21,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 10:30:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 10:30:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-11-20 10:30:21,909 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:22,603 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-20 10:30:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:30:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 10:30:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:22,607 INFO L225 Difference]: With dead ends: 46 [2022-11-20 10:30:22,607 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 10:30:22,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 10:30:22,609 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:22,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 61 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-11-20 10:30:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 10:30:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-20 10:30:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-20 10:30:22,622 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-20 10:30:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:22,623 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-20 10:30:22,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-20 10:30:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:30:22,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:22,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:22,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-20 10:30:22,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-20 10:30:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:22,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465182105] [2022-11-20 10:30:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:23,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465182105] [2022-11-20 10:30:23,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465182105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:23,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722100671] [2022-11-20 10:30:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:23,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:23,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:30:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:30:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:23,214 INFO L350 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 18 treesize of output 14 [2022-11-20 10:30:23,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:30:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:23,290 INFO L350 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 14 treesize of output 12 [2022-11-20 10:30:23,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 10:30:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722100671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:23,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:23,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-20 10:30:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963571265] [2022-11-20 10:30:23,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:23,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:30:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:30:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:30:23,313 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:23,428 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-20 10:30:23,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:30:23,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 10:30:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:23,432 INFO L225 Difference]: With dead ends: 48 [2022-11-20 10:30:23,432 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 10:30:23,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:30:23,438 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:23,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 43 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:30:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 10:30:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-20 10:30:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-20 10:30:23,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-11-20 10:30:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:23,468 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-20 10:30:23,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-20 10:30:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:30:23,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:23,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:23,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:23,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:23,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-20 10:30:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882736151] [2022-11-20 10:30:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:23,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882736151] [2022-11-20 10:30:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882736151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136709145] [2022-11-20 10:30:23,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:23,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:23,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:30:23,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:30:23,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:23,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:30:23,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136709145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:23,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:23,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 10:30:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017103684] [2022-11-20 10:30:23,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:30:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:30:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:30:23,981 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:24,136 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-20 10:30:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:30:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:24,138 INFO L225 Difference]: With dead ends: 70 [2022-11-20 10:30:24,138 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 10:30:24,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:30:24,139 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:24,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:30:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 10:30:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-11-20 10:30:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 10:30:24,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-20 10:30:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:24,148 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 10:30:24,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 10:30:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:30:24,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:24,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:24,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:24,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:24,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-20 10:30:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:24,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180028980] [2022-11-20 10:30:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180028980] [2022-11-20 10:30:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180028980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712660909] [2022-11-20 10:30:24,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:30:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:24,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:24,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:30:24,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:30:24,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:24,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:30:24,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:24,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:24,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712660909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:24,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:24,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 10:30:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22323352] [2022-11-20 10:30:24,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:24,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:30:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:30:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:30:24,719 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:24,849 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-20 10:30:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:24,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:30:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:24,852 INFO L225 Difference]: With dead ends: 39 [2022-11-20 10:30:24,852 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 10:30:24,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:30:24,853 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:24,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 24 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:30:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 10:30:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-20 10:30:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-20 10:30:24,863 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-11-20 10:30:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:24,863 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-20 10:30:24,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-20 10:30:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:30:24,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:24,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:24,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:25,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:30:25,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-20 10:30:25,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:25,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99226015] [2022-11-20 10:30:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99226015] [2022-11-20 10:30:26,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99226015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42459803] [2022-11-20 10:30:26,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:30:26,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:26,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:26,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:30:26,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:30:26,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:26,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 10:30:26,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:26,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:30:26,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:30:26,959 INFO L350 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 14 treesize of output 16 [2022-11-20 10:30:27,032 INFO L350 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 14 treesize of output 16 [2022-11-20 10:30:27,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 27 [2022-11-20 10:30:27,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:27,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-20 10:30:27,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:27,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:27,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-20 10:30:27,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-20 10:30:27,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-20 10:30:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:27,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:29,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:29,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-11-20 10:30:38,586 WARN L233 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:30:54,297 WARN L233 SmtUtils]: Spent 13.34s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:30:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:54,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42459803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:54,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:54,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 49 [2022-11-20 10:30:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808436443] [2022-11-20 10:30:54,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:54,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-20 10:30:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-20 10:30:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1994, Unknown=1, NotChecked=0, Total=2352 [2022-11-20 10:30:54,428 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:17,185 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-11-20 10:31:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-20 10:31:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 10:31:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:17,186 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:31:17,186 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:31:17,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=1090, Invalid=5551, Unknown=1, NotChecked=0, Total=6642 [2022-11-20 10:31:17,190 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 112 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:17,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 98 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 605 Invalid, 0 Unknown, 50 Unchecked, 2.7s Time] [2022-11-20 10:31:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:31:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2022-11-20 10:31:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-11-20 10:31:17,205 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 27 [2022-11-20 10:31:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:17,205 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-11-20 10:31:17,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-11-20 10:31:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:31:17,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:17,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:17,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:17,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 10:31:17,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-20 10:31:17,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:17,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257630633] [2022-11-20 10:31:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:17,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:18,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257630633] [2022-11-20 10:31:18,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257630633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:18,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696401684] [2022-11-20 10:31:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:18,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:18,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:31:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 10:31:18,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:18,213 INFO L350 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 11 [2022-11-20 10:31:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:18,321 INFO L350 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 23 treesize of output 22 [2022-11-20 10:31:18,365 INFO L350 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 19 treesize of output 7 [2022-11-20 10:31:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:18,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:18,528 INFO L350 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 16 treesize of output 14 [2022-11-20 10:31:18,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 10:31:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:18,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696401684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:18,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:18,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-20 10:31:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385345683] [2022-11-20 10:31:18,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:18,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:18,607 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:19,055 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-11-20 10:31:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:31:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 10:31:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:19,057 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:31:19,057 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 10:31:19,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:31:19,058 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:19,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:31:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 10:31:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-11-20 10:31:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-11-20 10:31:19,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 27 [2022-11-20 10:31:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:19,071 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-11-20 10:31:19,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-11-20 10:31:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:31:19,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:19,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:19,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:19,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:19,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-11-20 10:31:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:19,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071489534] [2022-11-20 10:31:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:19,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071489534] [2022-11-20 10:31:19,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071489534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:19,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819457407] [2022-11-20 10:31:19,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:31:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:19,515 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:19,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:31:19,616 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 10:31:19,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:19,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:19,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:19,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819457407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:20,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:20,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 10:31:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682802390] [2022-11-20 10:31:20,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:20,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:20,096 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,498 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-11-20 10:31:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:31:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 10:31:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,499 INFO L225 Difference]: With dead ends: 91 [2022-11-20 10:31:20,499 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 10:31:20,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:31:20,500 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 34 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:31:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 10:31:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-20 10:31:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-20 10:31:20,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-11-20 10:31:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,511 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-20 10:31:20,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-20 10:31:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:31:20,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:20,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:20,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:20,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-11-20 10:31:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235907719] [2022-11-20 10:31:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235907719] [2022-11-20 10:31:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235907719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125160421] [2022-11-20 10:31:20,978 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:31:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:20,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:21,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:31:21,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 10:31:21,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:21,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:21,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:21,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125160421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:21,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:21,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 10:31:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311659382] [2022-11-20 10:31:21,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:21,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:21,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:21,572 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:22,050 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-20 10:31:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:31:22,051 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 10:31:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:22,052 INFO L225 Difference]: With dead ends: 48 [2022-11-20 10:31:22,052 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 10:31:22,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:31:22,053 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:22,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 30 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:31:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 10:31:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 10:31:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-20 10:31:22,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-11-20 10:31:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:22,062 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-20 10:31:22,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-20 10:31:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:31:22,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:22,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:22,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:22,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:31:22,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-11-20 10:31:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994896414] [2022-11-20 10:31:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:27,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994896414] [2022-11-20 10:31:27,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994896414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:27,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288237064] [2022-11-20 10:31:27,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 10:31:27,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:27,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:27,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:31:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 10:31:27,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:27,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:31:27,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:31:27,359 INFO L350 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 14 treesize of output 16 [2022-11-20 10:31:27,435 INFO L350 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 14 treesize of output 16 [2022-11-20 10:31:27,494 INFO L350 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 14 treesize of output 16 [2022-11-20 10:31:27,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 27 [2022-11-20 10:31:28,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:28,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-20 10:31:28,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:28,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:28,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-20 10:31:29,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:31:29,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:29,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 10:31:29,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:29,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:29,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:31:29,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-11-20 10:31:29,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-11-20 10:31:30,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-11-20 10:31:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:30,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:38,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:38,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-11-20 10:31:40,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (< .cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10 1)))))) (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)))))) is different from false [2022-11-20 10:31:43,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3 .cse4))))) (+ 7 .cse6)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse5) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (< (+ .cse6 5) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10)))))) (not (= (select v_arrayElimArr_4 .cse5) 6)))))) is different from false [2022-11-20 10:31:46,533 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (+ .cse1 11) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)) (< (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10))))) (+ .cse1 13)))))) is different from false [2022-11-20 10:31:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-20 10:31:46,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288237064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:46,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:46,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-11-20 10:31:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374444202] [2022-11-20 10:31:46,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:46,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 10:31:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 10:31:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3009, Unknown=3, NotChecked=348, Total=3782 [2022-11-20 10:31:46,714 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:40,088 WARN L233 SmtUtils]: Spent 17.30s on a formula simplification. DAG size of input: 71 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:33:24,740 WARN L233 SmtUtils]: Spent 11.34s on a formula simplification. DAG size of input: 72 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:33:52,467 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 162 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:33:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:53,227 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-11-20 10:33:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 10:33:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 10:33:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:53,229 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:33:53,229 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:33:53,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 138.5s TimeCoverageRelationStatistics Valid=712, Invalid=4677, Unknown=25, NotChecked=438, Total=5852 [2022-11-20 10:33:53,232 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:53,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 133 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 938 Invalid, 0 Unknown, 241 Unchecked, 7.0s Time] [2022-11-20 10:33:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:33:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-11-20 10:33:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-20 10:33:53,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 34 [2022-11-20 10:33:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-20 10:33:53,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-20 10:33:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:33:53,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:53,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:53,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:53,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:53,453 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:33:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-20 10:33:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:53,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2509954] [2022-11-20 10:33:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:33:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:54,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2509954] [2022-11-20 10:33:54,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2509954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:54,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291085126] [2022-11-20 10:33:54,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:33:54,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:54,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:54,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:54,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:33:54,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:33:54,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:33:54,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 10:33:54,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:55,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:33:55,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:55,803 INFO L350 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 25 treesize of output 24 [2022-11-20 10:33:56,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:56,084 INFO L350 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 25 treesize of output 24 [2022-11-20 10:33:56,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:33:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:33:56,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:56,934 INFO L350 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 16 treesize of output 14 [2022-11-20 10:33:56,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 10:33:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:33:57,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291085126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:57,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:57,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-20 10:33:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340874402] [2022-11-20 10:33:57,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:33:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:33:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-11-20 10:33:57,225 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:00,396 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-20 10:34:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:34:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 10:34:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:00,400 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:34:00,400 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 10:34:00,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 10:34:00,402 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:00,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 10:34:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 10:34:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-20 10:34:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-20 10:34:00,417 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-11-20 10:34:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:00,417 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-20 10:34:00,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-20 10:34:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:34:00,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:00,419 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:00,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:34:00,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:34:00,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:34:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-11-20 10:34:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:00,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44165674] [2022-11-20 10:34:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:34:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44165674] [2022-11-20 10:34:01,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44165674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:34:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701602335] [2022-11-20 10:34:01,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:34:01,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:01,176 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:34:01,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:34:01,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:34:01,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:34:01,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:34:01,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:34:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:34:01,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:34:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:34:02,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701602335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:34:02,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:34:02,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 10:34:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615504924] [2022-11-20 10:34:02,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:34:02,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 10:34:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:34:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:34:02,433 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:03,522 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-11-20 10:34:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:34:03,522 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 10:34:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:03,524 INFO L225 Difference]: With dead ends: 99 [2022-11-20 10:34:03,524 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 10:34:03,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:34:03,526 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:03,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 30 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:34:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 10:34:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-20 10:34:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-20 10:34:03,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-11-20 10:34:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:03,543 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-20 10:34:03,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-20 10:34:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:34:03,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:03,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:03,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:34:03,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:03,751 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:34:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-11-20 10:34:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:03,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997162096] [2022-11-20 10:34:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:34:04,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997162096] [2022-11-20 10:34:04,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997162096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:34:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353516217] [2022-11-20 10:34:04,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:34:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:04,370 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:34:04,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:34:04,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 10:34:04,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:34:04,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:34:04,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:34:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:34:05,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:34:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:34:05,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353516217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:34:05,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:34:05,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 10:34:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870776542] [2022-11-20 10:34:05,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:34:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 10:34:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:05,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:34:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:34:05,684 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:07,173 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-20 10:34:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:34:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 10:34:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:07,174 INFO L225 Difference]: With dead ends: 57 [2022-11-20 10:34:07,175 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 10:34:07,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:34:07,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:07,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 36 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:34:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 10:34:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-20 10:34:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-20 10:34:07,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-11-20 10:34:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:07,189 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-20 10:34:07,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-20 10:34:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:34:07,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:07,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:07,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:34:07,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:34:07,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:34:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-11-20 10:34:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:07,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726031179] [2022-11-20 10:34:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:34:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:17,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726031179] [2022-11-20 10:34:17,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726031179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:34:17,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903873312] [2022-11-20 10:34:17,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:34:17,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:17,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:17,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:34:17,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:34:17,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:34:17,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:34:17,172 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-20 10:34:17,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:34:17,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:34:17,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:34:17,262 INFO L350 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 14 treesize of output 16 [2022-11-20 10:34:17,394 INFO L350 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 14 treesize of output 16 [2022-11-20 10:34:17,494 INFO L350 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 14 treesize of output 16 [2022-11-20 10:34:17,599 INFO L350 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 14 treesize of output 16 [2022-11-20 10:34:18,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 27 [2022-11-20 10:34:19,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-11-20 10:34:21,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:21,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:21,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:21,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-11-20 10:34:22,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:22,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:22,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:22,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-20 10:34:23,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:34:23,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:23,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:23,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:23,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-11-20 10:34:24,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:34:24,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:24,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-20 10:34:25,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:25,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:34:25,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-20 10:34:26,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-20 10:34:27,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 41 [2022-11-20 10:34:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:34:27,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:00,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:00,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-11-20 10:35:03,768 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse6 .cse7)))))) (+ 7 .cse9)) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse6))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (+ .cse9 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse14 .cse15))))))) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse14))))))) is different from false [2022-11-20 10:35:06,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 13)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= 6 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (< (+ .cse9 11) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse14 .cse15))))))) (not (= 6 .cse14))))))) is different from false [2022-11-20 10:35:09,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (not (= 6 .cse3)) (< (+ .cse4 17) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse14 .cse15)))))) (+ 19 .cse4)) (not (= 6 .cse14))))))) is different from false [2022-11-20 10:35:12,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 23 .cse0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6))))))) (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (not (= 6 .cse5))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (+ .cse0 25)) (not (= 6 .cse14))))))) is different from false [2022-11-20 10:35:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-20 10:35:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903873312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:12,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:35:12,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 79 [2022-11-20 10:35:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516480390] [2022-11-20 10:35:12,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-20 10:35:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-20 10:35:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-11-20 10:35:12,706 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 79 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:23,338 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-20 10:35:23,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-20 10:35:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:23,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-11-20 10:35:23,341 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 14 Unchecked, 1.6s Time] [2022-11-20 10:35:23,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:35:23,542 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-11-20 10:35:23,547 INFO L158 Benchmark]: Toolchain (without parser) took 306416.18ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 112.6MB in the beginning and 179.4MB in the end (delta: -66.8MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-11-20 10:35:23,547 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:23,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.44ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 116.9MB in the end (delta: -4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:35:23,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.63ms. Allocated memory is still 153.1MB. Free memory was 116.9MB in the beginning and 115.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:23,548 INFO L158 Benchmark]: Boogie Preprocessor took 27.39ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 113.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:23,548 INFO L158 Benchmark]: RCFGBuilder took 410.72ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 101.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:35:23,549 INFO L158 Benchmark]: TraceAbstraction took 305501.04ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 101.2MB in the beginning and 179.4MB in the end (delta: -78.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:23,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.44ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 116.9MB in the end (delta: -4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.63ms. Allocated memory is still 153.1MB. Free memory was 116.9MB in the beginning and 115.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.39ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 113.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.72ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 101.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 305501.04ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 101.2MB in the beginning and 179.4MB in the end (delta: -78.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:35:25,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:35:25,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:35:25,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:35:25,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:35:25,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:35:26,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:35:26,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:35:26,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:35:26,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:35:26,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:35:26,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:35:26,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:35:26,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:35:26,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:35:26,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:35:26,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:35:26,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:35:26,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:35:26,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:35:26,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:35:26,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:35:26,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:35:26,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:35:26,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:35:26,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:35:26,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:35:26,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:35:26,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:35:26,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:35:26,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:35:26,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:35:26,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:35:26,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:35:26,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:35:26,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:35:26,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:35:26,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:35:26,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:35:26,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:35:26,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:35:26,085 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 10:35:26,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:35:26,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:35:26,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:35:26,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:35:26,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:35:26,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:35:26,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:35:26,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:35:26,134 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:35:26,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:35:26,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:35:26,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:35:26,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:35:26,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:35:26,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:35:26,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:35:26,137 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:35:26,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:35:26,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:35:26,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:35:26,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:35:26,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:35:26,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:35:26,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:35:26,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:35:26,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:35:26,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:26,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:35:26,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:35:26,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:35:26,141 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:35:26,141 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:35:26,142 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:35:26,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:35:26,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:35:26,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:35:26,143 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/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_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-11-20 10:35:26,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:35:26,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:35:26,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:35:26,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:35:26,561 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:35:26,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-11-20 10:35:29,811 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:35:30,027 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:35:30,027 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c [2022-11-20 10:35:30,034 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/640bedae3/6dd01ac90fd94b48a5b746118309e113/FLAG3116bd659 [2022-11-20 10:35:30,059 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/data/640bedae3/6dd01ac90fd94b48a5b746118309e113 [2022-11-20 10:35:30,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:35:30,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:35:30,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:30,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:35:30,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:35:30,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bd7509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30, skipping insertion in model container [2022-11-20 10:35:30,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:35:30,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:35:30,251 WARN L237 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_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-20 10:35:30,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:30,289 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:35:30,304 WARN L237 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_29a99877-95d9-4220-b63c-4067c3937a06/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-20 10:35:30,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:30,340 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:35:30,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30 WrapperNode [2022-11-20 10:35:30,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:30,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:30,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:35:30,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:35:30,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,412 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-11-20 10:35:30,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:30,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:35:30,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:35:30,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:35:30,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,471 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:35:30,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:35:30,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:35:30,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:35:30,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (1/1) ... [2022-11-20 10:35:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:30,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:35:30,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:35:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:35:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:35:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:35:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-20 10:35:30,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:35:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 10:35:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:35:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:35:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-20 10:35:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:35:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:35:30,697 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:35:30,699 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:35:31,023 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:35:31,029 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:35:31,029 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 10:35:31,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:31 BoogieIcfgContainer [2022-11-20 10:35:31,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:35:31,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:35:31,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:35:31,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:35:31,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:35:30" (1/3) ... [2022-11-20 10:35:31,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793621c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:31, skipping insertion in model container [2022-11-20 10:35:31,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:30" (2/3) ... [2022-11-20 10:35:31,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793621c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:31, skipping insertion in model container [2022-11-20 10:35:31,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:31" (3/3) ... [2022-11-20 10:35:31,048 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-11-20 10:35:31,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:35:31,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:35:31,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:35:31,154 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1719a183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:35:31,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:35:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:35:31,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:31,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:31,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-20 10:35:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:31,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8376780] [2022-11-20 10:35:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:31,199 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 [2022-11-20 10:35:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:31,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:31,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:31,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:35:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:31,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:31,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:31,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8376780] [2022-11-20 10:35:31,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8376780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:31,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:31,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469528719] [2022-11-20 10:35:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:31,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:35:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:35:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:35:31,422 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:31,438 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-20 10:35:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:35:31,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:35:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:31,448 INFO L225 Difference]: With dead ends: 40 [2022-11-20 10:35:31,449 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 10:35:31,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:35:31,455 INFO L413 NwaCegarLoop]: 26 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, 26 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 [2022-11-20 10:35:31,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 10:35:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 10:35:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-20 10:35:31,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-20 10:35:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:31,488 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-20 10:35:31,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-20 10:35:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:35:31,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:31,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:31,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:31,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-20 10:35:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801131119] [2022-11-20 10:35:31,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:31,705 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 [2022-11-20 10:35:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:31,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:31,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:31,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:35:31,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:32,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:32,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801131119] [2022-11-20 10:35:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801131119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:32,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:32,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:35:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75848874] [2022-11-20 10:35:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:32,005 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:32,188 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-20 10:35:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:35:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:35:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:32,190 INFO L225 Difference]: With dead ends: 36 [2022-11-20 10:35:32,190 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 10:35:32,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:35:32,192 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:32,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 10:35:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-20 10:35:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-20 10:35:32,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-20 10:35:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:32,201 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-20 10:35:32,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-20 10:35:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:35:32,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:32,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:32,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:32,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:32,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-20 10:35:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468991174] [2022-11-20 10:35:32,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:32,417 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 [2022-11-20 10:35:32,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:32,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:32,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:32,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 10:35:32,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:32,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:32,700 INFO L350 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 18 treesize of output 19 [2022-11-20 10:35:32,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:35:32,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:32,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 10:35:33,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:33,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-11-20 10:35:33,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:33,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-11-20 10:35:33,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:33,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2022-11-20 10:35:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:33,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:41,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:41,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468991174] [2022-11-20 10:35:41,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468991174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:41,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:35:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-20 10:35:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100528095] [2022-11-20 10:35:41,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:41,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:35:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:41,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:35:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=448, Unknown=1, NotChecked=0, Total=552 [2022-11-20 10:35:41,575 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:35:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:48,568 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-20 10:35:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:35:48,569 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 10:35:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:48,570 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:35:48,570 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 10:35:48,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=251, Invalid=1008, Unknown=1, NotChecked=0, Total=1260 [2022-11-20 10:35:48,572 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:48,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 57 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 47 Unchecked, 3.4s Time] [2022-11-20 10:35:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 10:35:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-11-20 10:35:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-20 10:35:48,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-11-20 10:35:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:48,593 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-20 10:35:48,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-20 10:35:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:35:48,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:48,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:48,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:48,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:48,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-20 10:35:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821683647] [2022-11-20 10:35:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:48,808 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 [2022-11-20 10:35:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:48,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:48,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:48,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:35:48,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:48,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:35:48,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:35:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:48,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:49,033 INFO L350 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 14 treesize of output 12 [2022-11-20 10:35:49,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 10:35:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:49,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821683647] [2022-11-20 10:35:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821683647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:49,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:35:49,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-20 10:35:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342744025] [2022-11-20 10:35:49,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:35:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:35:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:49,065 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:49,305 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-20 10:35:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:35:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 10:35:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:49,308 INFO L225 Difference]: With dead ends: 49 [2022-11-20 10:35:49,308 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 10:35:49,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:35:49,310 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:49,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:35:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 10:35:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 10:35:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-20 10:35:49,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-11-20 10:35:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:49,321 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-20 10:35:49,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-20 10:35:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:35:49,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:49,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:49,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:49,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:49,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-20 10:35:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003355736] [2022-11-20 10:35:49,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:35:49,536 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 [2022-11-20 10:35:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:49,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:49,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:49,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:35:49,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:49,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:35:49,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:49,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:50,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003355736] [2022-11-20 10:35:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003355736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:50,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:35:50,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-20 10:35:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023691859] [2022-11-20 10:35:50,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:35:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:35:50,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:35:50,134 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:50,939 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-20 10:35:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:35:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:35:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:50,941 INFO L225 Difference]: With dead ends: 63 [2022-11-20 10:35:50,941 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 10:35:50,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:35:50,943 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:50,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 23 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:35:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 10:35:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-11-20 10:35:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 10:35:50,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-20 10:35:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:50,953 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 10:35:50,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 10:35:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:35:50,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:50,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:50,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:51,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:51,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-20 10:35:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:51,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910357076] [2022-11-20 10:35:51,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:35:51,168 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 [2022-11-20 10:35:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:51,169 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:51,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:51,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:35:51,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:51,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:35:51,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:51,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:51,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:51,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910357076] [2022-11-20 10:35:51,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910357076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:51,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:35:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-11-20 10:35:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314669522] [2022-11-20 10:35:51,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:51,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:35:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:35:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:35:51,984 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:53,165 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-20 10:35:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:35:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:35:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:53,167 INFO L225 Difference]: With dead ends: 72 [2022-11-20 10:35:53,167 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 10:35:53,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-20 10:35:53,169 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 217 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:53,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:35:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 10:35:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-11-20 10:35:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-11-20 10:35:53,182 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-11-20 10:35:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:53,182 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-11-20 10:35:53,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-11-20 10:35:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:35:53,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:53,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:53,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:53,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:35:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-20 10:35:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129163410] [2022-11-20 10:35:53,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:35:53,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 [2022-11-20 10:35:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:53,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:35:53,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:35:53,599 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:35:53,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:53,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 10:35:53,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:53,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:53,689 INFO L350 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 18 treesize of output 19 [2022-11-20 10:35:53,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:35:53,791 INFO L350 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 25 treesize of output 25 [2022-11-20 10:35:53,906 INFO L350 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 25 treesize of output 25 [2022-11-20 10:35:54,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:54,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 10:35:54,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:54,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2022-11-20 10:35:55,210 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:35:55,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2022-11-20 10:35:55,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:55,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-11-20 10:35:55,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:55,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 83 [2022-11-20 10:35:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:55,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:36:41,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:36:41,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-11-20 10:36:52,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:52,380 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:36:52,380 INFO L350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 1 [2022-11-20 10:36:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:52,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:36:52,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129163410] [2022-11-20 10:36:52,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129163410] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:36:52,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:36:52,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-11-20 10:36:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930681390] [2022-11-20 10:36:52,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:36:52,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 10:36:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:36:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 10:36:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1056, Unknown=20, NotChecked=0, Total=1260 [2022-11-20 10:36:52,386 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:10,346 WARN L233 SmtUtils]: Spent 12.64s on a formula simplification. DAG size of input: 77 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:34,097 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:59,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:38:12,468 WARN L233 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 64 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:14,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:38:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:18,694 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-20 10:38:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:38:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 10:38:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:18,695 INFO L225 Difference]: With dead ends: 62 [2022-11-20 10:38:18,696 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:38:18,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 134.8s TimeCoverageRelationStatistics Valid=459, Invalid=2584, Unknown=37, NotChecked=0, Total=3080 [2022-11-20 10:38:18,702 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:18,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 60 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 338 Invalid, 2 Unknown, 223 Unchecked, 7.7s Time] [2022-11-20 10:38:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:38:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-20 10:38:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-20 10:38:18,715 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-11-20 10:38:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:18,715 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-20 10:38:18,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-20 10:38:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:38:18,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:18,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:18,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:38:18,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:38:18,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:38:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-20 10:38:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:38:18,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820130423] [2022-11-20 10:38:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:18,930 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 [2022-11-20 10:38:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:38:18,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:38:18,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:38:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:19,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:38:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:19,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:38:19,287 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:38:19,288 INFO L350 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:38:19,369 INFO L350 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 19 treesize of output 7 [2022-11-20 10:38:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:38:19,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:19,601 INFO L350 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 16 treesize of output 14 [2022-11-20 10:38:19,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 10:38:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:38:19,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:38:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820130423] [2022-11-20 10:38:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820130423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:19,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:38:19,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-20 10:38:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321436631] [2022-11-20 10:38:19,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:19,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:38:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:38:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:38:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:38:19,731 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:20,552 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-20 10:38:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:38:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 10:38:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:20,554 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:38:20,554 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 10:38:20,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:38:20,556 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:20,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:38:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 10:38:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-20 10:38:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-20 10:38:20,565 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-11-20 10:38:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:20,566 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-20 10:38:20,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-20 10:38:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:38:20,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:20,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:20,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:20,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:38:20,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:38:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-11-20 10:38:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:38:20,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64821901] [2022-11-20 10:38:20,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:38:20,776 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 [2022-11-20 10:38:20,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:38:20,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:38:20,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:38:20,923 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 10:38:20,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:38:20,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:38:20,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:38:21,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:38:23,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:38:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64821901] [2022-11-20 10:38:23,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64821901] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:23,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:38:23,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-11-20 10:38:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985031536] [2022-11-20 10:38:23,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:38:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:38:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:38:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:38:23,265 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:26,715 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-11-20 10:38:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:38:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 10:38:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:26,717 INFO L225 Difference]: With dead ends: 88 [2022-11-20 10:38:26,717 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 10:38:26,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 10:38:26,718 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 392 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:26,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 25 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 10:38:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 10:38:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-11-20 10:38:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-20 10:38:26,738 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-11-20 10:38:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:26,739 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-20 10:38:26,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-20 10:38:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:38:26,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:26,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:26,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:26,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:38:26,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:38:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-11-20 10:38:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:38:26,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210760835] [2022-11-20 10:38:26,955 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:38:26,956 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 [2022-11-20 10:38:26,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:38:26,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:38:26,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:38:27,183 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 10:38:27,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:38:27,193 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 10:38:27,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:27,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:27,386 INFO L350 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 18 treesize of output 19 [2022-11-20 10:38:27,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:38:27,541 INFO L350 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 25 treesize of output 25 [2022-11-20 10:38:27,780 INFO L350 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 25 treesize of output 25 [2022-11-20 10:38:28,002 INFO L350 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 25 treesize of output 25 [2022-11-20 10:38:28,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:28,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 10:38:29,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:29,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-20 10:38:30,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:30,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2022-11-20 10:38:30,923 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 10:38:30,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2022-11-20 10:38:32,028 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 10:38:32,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 96 [2022-11-20 10:38:32,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:32,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2022-11-20 10:38:33,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:33,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 142 [2022-11-20 10:38:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:33,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:46,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:46,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-11-20 10:41:16,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:16,354 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:41:16,355 INFO L350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2506 treesize of output 1 [2022-11-20 10:41:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:41:16,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210760835] [2022-11-20 10:41:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210760835] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:41:16,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:16,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-11-20 10:41:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404187016] [2022-11-20 10:41:16,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 10:41:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 10:41:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1823, Unknown=29, NotChecked=0, Total=2162 [2022-11-20 10:41:16,361 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:41:53,642 WARN L233 SmtUtils]: Spent 11.13s on a formula simplification. DAG size of input: 244 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:42:37,975 WARN L233 SmtUtils]: Spent 21.88s on a formula simplification. DAG size of input: 98 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:42:58,799 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 144 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:43:00,999 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse76 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse76)) (.cse71 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse72 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse76))) (let ((.cse59 (select .cse71 .cse72)) (.cse70 (select .cse71 .cse75))) (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse76)) (.cse16 (store .cse71 .cse75 (bvadd .cse70 (_ bv5 32)))) (.cse73 (bvadd .cse59 (_ bv5 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (store .cse16 .cse72 .cse73)) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse74 (select .cse71 .cse29))) (let ((.cse31 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse30 (bvadd .cse74 (_ bv5 32))) (.cse32 (not (= .cse74 (_ bv1 32)))) (.cse34 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse28 (store .cse71 .cse72 .cse73)) (.cse1 (not (= .cse70 (_ bv1 32)))) (.cse47 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse48 (= (let ((.cse60 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (bvadd (concat (select .cse68 .cse7) (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse67 ((_ extract 31 0) .cse69)) (.cse66 ((_ extract 63 32) .cse69))) (let ((.cse64 (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse67) .cse7 .cse66))) (let ((.cse65 (bvadd ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse66 .cse67)))) (let ((.cse62 ((_ extract 31 0) .cse65)) (.cse61 ((_ extract 63 32) .cse65))) (bvadd (concat .cse61 .cse62) ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse7 .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse2)) (.cse33 (not (= .cse59 (_ bv1 32))))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (or .cse1 (= .cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse14 .cse7) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse13 ((_ extract 31 0) .cse15)) (.cse12 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse7 .cse12))) (let ((.cse10 (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse12 .cse13)))) (let ((.cse8 ((_ extract 63 32) .cse10)) (.cse6 ((_ extract 31 0) .cse10))) (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse7 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse8 .cse6))))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse17 (let ((.cse27 (store .cse28 .cse29 .cse30))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse25 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (bvadd ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse25 .cse7) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse7 .cse23))) (let ((.cse22 (bvadd (concat .cse23 .cse24) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))))) (let ((.cse19 ((_ extract 31 0) .cse22)) (.cse18 ((_ extract 63 32) .cse22))) (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse7 .cse18)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse2) .cse31 .cse32 .cse33) (or .cse31 .cse34 (= .cse2 (let ((.cse35 (let ((.cse45 (store .cse46 .cse29 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse43 .cse7) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse39 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse7 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse41 .cse42)))) (let ((.cse37 ((_ extract 31 0) .cse40)) (.cse36 ((_ extract 63 32) .cse40))) (bvadd (concat .cse36 .cse37) ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse7 .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse32 .cse33) (or .cse34 .cse47 .cse48 .cse33) .cse0 (or (= .cse2 (let ((.cse49 (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (bvadd (concat (select .cse57 .cse7) (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse7 .cse55))) (let ((.cse54 (bvadd ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse55 .cse56)))) (let ((.cse51 ((_ extract 31 0) .cse54)) (.cse50 ((_ extract 63 32) .cse54))) (bvadd (concat .cse50 .cse51) ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51) .cse7 .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))) .cse47 .cse33) (or .cse1 .cse47 .cse48 .cse33)))))))) is different from false [2022-11-20 10:43:03,016 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse76 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse76)) (.cse71 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse72 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse76))) (let ((.cse59 (select .cse71 .cse72)) (.cse70 (select .cse71 .cse75))) (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse76)) (.cse16 (store .cse71 .cse75 (bvadd .cse70 (_ bv5 32)))) (.cse73 (bvadd .cse59 (_ bv5 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (store .cse16 .cse72 .cse73)) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse74 (select .cse71 .cse29))) (let ((.cse31 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse30 (bvadd .cse74 (_ bv5 32))) (.cse32 (not (= .cse74 (_ bv1 32)))) (.cse34 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse28 (store .cse71 .cse72 .cse73)) (.cse1 (not (= .cse70 (_ bv1 32)))) (.cse47 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse48 (= (let ((.cse60 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (bvadd (concat (select .cse68 .cse7) (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse67 ((_ extract 31 0) .cse69)) (.cse66 ((_ extract 63 32) .cse69))) (let ((.cse64 (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse67) .cse7 .cse66))) (let ((.cse65 (bvadd ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse66 .cse67)))) (let ((.cse62 ((_ extract 31 0) .cse65)) (.cse61 ((_ extract 63 32) .cse65))) (bvadd (concat .cse61 .cse62) ((_ sign_extend 32) (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse7 .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse2)) (.cse33 (not (= .cse59 (_ bv1 32))))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (or .cse1 (= .cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse14 .cse7) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse13 ((_ extract 31 0) .cse15)) (.cse12 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse7 .cse12))) (let ((.cse10 (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse12 .cse13)))) (let ((.cse8 ((_ extract 63 32) .cse10)) (.cse6 ((_ extract 31 0) .cse10))) (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse7 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse8 .cse6))))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse17 (let ((.cse27 (store .cse28 .cse29 .cse30))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse25 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (bvadd ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse25 .cse7) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse7 .cse23))) (let ((.cse22 (bvadd (concat .cse23 .cse24) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))))) (let ((.cse19 ((_ extract 31 0) .cse22)) (.cse18 ((_ extract 63 32) .cse22))) (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse7 .cse18)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse2) .cse31 .cse32 .cse33) (or .cse31 .cse34 (= .cse2 (let ((.cse35 (let ((.cse45 (store .cse46 .cse29 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse43 .cse7) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse39 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse7 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse41 .cse42)))) (let ((.cse37 ((_ extract 31 0) .cse40)) (.cse36 ((_ extract 63 32) .cse40))) (bvadd (concat .cse36 .cse37) ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse7 .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse32 .cse33) (or .cse34 .cse47 .cse48 .cse33) .cse0 (or (= .cse2 (let ((.cse49 (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (bvadd (concat (select .cse57 .cse7) (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse7 .cse55))) (let ((.cse54 (bvadd ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse55 .cse56)))) (let ((.cse51 ((_ extract 31 0) .cse54)) (.cse50 ((_ extract 63 32) .cse54))) (bvadd (concat .cse50 .cse51) ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51) .cse7 .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))) .cse47 .cse33) (or .cse1 .cse47 .cse48 .cse33)))))))) is different from true [2022-11-20 10:43:34,937 WARN L233 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:43:41,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:43:43,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:43:45,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:43:48,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:43:59,870 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 80 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:44:03,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:44:05,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:44:10,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:44:14,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:44:36,581 WARN L233 SmtUtils]: Spent 15.89s on a formula simplification. DAG size of input: 75 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:44:39,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 10:44:41,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse71 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse66 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse67 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse71))) (let ((.cse55 (select .cse66 .cse67)) (.cse70 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse71))) (let ((.cse23 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse71)) (.cse54 (select .cse66 .cse70)) (.cse68 (bvadd .cse55 (_ bv5 32)))) (let ((.cse14 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (store (store .cse66 .cse70 (bvadd .cse54 (_ bv5 32))) .cse67 .cse68)) (.cse25 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse69 (select .cse66 .cse23))) (let ((.cse26 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse24 (bvadd .cse69 (_ bv5 32))) (.cse27 (not (= .cse69 (_ bv1 32)))) (.cse29 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse22 (store .cse66 .cse67 .cse68)) (.cse42 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse43 (= (let ((.cse56 (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41))) (let ((.cse64 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (bvadd (concat (select .cse64 .cse5) (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse63 ((_ extract 31 0) .cse65)) (.cse62 ((_ extract 63 32) .cse65))) (let ((.cse60 (store (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse63) .cse5 .cse62))) (let ((.cse61 (bvadd ((_ sign_extend 32) (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse18)) (concat .cse62 .cse63)))) (let ((.cse58 ((_ extract 31 0) .cse61)) (.cse57 ((_ extract 63 32) .cse61))) (bvadd (concat .cse57 .cse58) ((_ sign_extend 32) (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58) .cse5 .cse57)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))))))))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse25)) (.cse28 (not (= .cse55 (_ bv1 32))))) (and (let ((.cse0 (bvule c_~N~0 (_ bv536870911 32)))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) (not (bvslt (_ bv3 32) c_~N~0)) (exists ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1.base| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select .cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (let ((.cse6 ((_ sign_extend 32) (_ bv6 32)))) (bvadd .cse6 (let ((.cse7 (bvadd (let ((.cse8 (bvadd .cse6 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) ((_ sign_extend 32) .cse4)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7)))))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (_ bv6 32) (select .cse1 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) ((_ extract 31 0) .cse3)) (= (_ bv6 32) (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|)) (= (_ bv6 32) .cse4) (= ((_ extract 63 32) .cse3) (select .cse2 .cse5))))))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse9 (let ((.cse21 (store .cse22 .cse23 .cse24))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse19 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (bvadd ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse19 .cse5) (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse17 ((_ extract 31 0) .cse20)) (.cse16 ((_ extract 63 32) .cse20))) (let ((.cse13 (store (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse5 .cse16))) (let ((.cse15 (bvadd (concat .cse16 .cse17) ((_ sign_extend 32) (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse18))))) (let ((.cse11 ((_ extract 31 0) .cse15)) (.cse10 ((_ extract 63 32) .cse15))) (bvadd (concat .cse10 .cse11) ((_ sign_extend 32) (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11) .cse5 .cse10)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))))))))))))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) .cse25) .cse26 .cse27 .cse28) (bvslt (_ bv2 32) c_~N~0) (or .cse26 .cse29 (= .cse25 (let ((.cse30 (let ((.cse40 (store .cse41 .cse23 .cse24))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40))) (let ((.cse38 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (bvadd ((_ sign_extend 32) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse38 .cse5) (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse37 ((_ extract 31 0) .cse39)) (.cse36 ((_ extract 63 32) .cse39))) (let ((.cse34 (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse5 .cse36))) (let ((.cse35 (bvadd ((_ sign_extend 32) (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse34) |c_ULTIMATE.start_main_~a~0#1.base|) .cse18)) (concat .cse36 .cse37)))) (let ((.cse32 ((_ extract 31 0) .cse35)) (.cse31 ((_ extract 63 32) .cse35))) (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse5 .cse31)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))))))))))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))) .cse27 .cse28) (or .cse29 .cse42 .cse43 .cse28) (or (= .cse25 (let ((.cse44 (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse52 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (bvadd (concat (select .cse52 .cse5) (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse51 ((_ extract 31 0) .cse53)) (.cse50 ((_ extract 63 32) .cse53))) (let ((.cse48 (store (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51) .cse5 .cse50))) (let ((.cse49 (bvadd ((_ sign_extend 32) (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|) .cse18)) (concat .cse50 .cse51)))) (let ((.cse46 ((_ extract 31 0) .cse49)) (.cse45 ((_ extract 63 32) .cse49))) (bvadd (concat .cse45 .cse46) ((_ sign_extend 32) (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse46) .cse5 .cse45)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))))))))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44)))) .cse42 .cse28) (or (not (= .cse54 (_ bv1 32))) .cse42 .cse43 .cse28)))))))) is different from false [2022-11-20 10:44:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:42,840 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-20 10:44:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:44:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 10:44:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:42,841 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:44:42,841 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 10:44:42,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 322.6s TimeCoverageRelationStatistics Valid=722, Invalid=4079, Unknown=37, NotChecked=274, Total=5112 [2022-11-20 10:44:42,844 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 99 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:42,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 72 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 566 Invalid, 6 Unknown, 182 Unchecked, 43.3s Time] [2022-11-20 10:44:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 10:44:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2022-11-20 10:44:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-20 10:44:42,866 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 34 [2022-11-20 10:44:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:42,868 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-20 10:44:42,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-20 10:44:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:44:42,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:42,873 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:42,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:43,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:44:43,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:44:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-20 10:44:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999152842] [2022-11-20 10:44:43,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:44:43,080 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 [2022-11-20 10:44:43,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:43,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:44:43,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:44:43,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:44:43,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:43,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:44:43,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:43,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:44:43,535 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:44:43,535 INFO L350 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:44:43,684 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:44:43,684 INFO L350 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:44:43,780 INFO L350 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 19 treesize of output 7 [2022-11-20 10:44:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:44:43,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:44,191 INFO L350 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 16 treesize of output 14 [2022-11-20 10:44:44,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 10:44:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:44:44,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:44,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999152842] [2022-11-20 10:44:44,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999152842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:44,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:44,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-20 10:44:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820426704] [2022-11-20 10:44:44,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:44,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:44:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:44:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:44:44,445 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:46,156 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-11-20 10:44:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:44:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 10:44:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:46,159 INFO L225 Difference]: With dead ends: 85 [2022-11-20 10:44:46,159 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 10:44:46,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:44:46,160 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:46,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 10:44:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 10:44:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-11-20 10:44:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-20 10:44:46,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 34 [2022-11-20 10:44:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:46,176 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-20 10:44:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-20 10:44:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:44:46,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:46,178 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:46,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:46,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:44:46,383 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:44:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 7 times [2022-11-20 10:44:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603542774] [2022-11-20 10:44:46,384 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 10:44:46,384 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 [2022-11-20 10:44:46,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:46,385 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:44:46,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:44:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:46,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 10:44:46,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:44:48,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:44:50,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603542774] [2022-11-20 10:44:50,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603542774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:50,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:50,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2022-11-20 10:44:50,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876474731] [2022-11-20 10:44:50,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:50,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 10:44:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 10:44:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-11-20 10:44:50,341 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:55,254 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-20 10:44:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:44:55,255 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 10:44:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:55,256 INFO L225 Difference]: With dead ends: 104 [2022-11-20 10:44:55,256 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 10:44:55,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=551, Invalid=1899, Unknown=0, NotChecked=0, Total=2450 [2022-11-20 10:44:55,257 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 380 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:55,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 35 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 10:44:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 10:44:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-11-20 10:44:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-20 10:44:55,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 36 [2022-11-20 10:44:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:55,289 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-20 10:44:55,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:44:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-20 10:44:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:44:55,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:55,293 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:55,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:55,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:44:55,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:44:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 8 times [2022-11-20 10:44:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:55,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457538257] [2022-11-20 10:44:55,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:44:55,507 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 [2022-11-20 10:44:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:55,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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) [2022-11-20 10:44:55,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a99877-95d9-4220-b63c-4067c3937a06/bin/uautomizer-ug76WZFUDN/mathsat -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 [2022-11-20 10:44:55,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:44:55,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:55,707 WARN L261 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 10:44:55,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:55,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:55,936 INFO L350 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 18 treesize of output 19 [2022-11-20 10:44:55,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-11-20 10:44:56,117 INFO L350 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 25 treesize of output 25 [2022-11-20 10:44:56,320 INFO L350 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 25 treesize of output 25 [2022-11-20 10:44:56,626 INFO L350 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 25 treesize of output 25 [2022-11-20 10:44:56,963 INFO L350 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 25 treesize of output 25 [2022-11-20 10:44:57,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:44:57,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 10:44:58,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:44:58,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-20 10:44:59,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:44:59,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 71 [2022-11-20 10:45:00,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:45:00,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 73 [2022-11-20 10:45:01,416 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-20 10:45:01,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 117 treesize of output 94