./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/prefixsum_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R --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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- 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-38b53e6 [2022-11-25 17:22:22,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:22:22,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:22:22,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:22:22,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:22:22,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:22:22,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:22:22,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:22:22,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:22:22,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:22:22,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:22:22,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:22:22,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:22:22,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:22:22,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:22:22,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:22:22,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:22:22,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:22:22,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:22:22,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:22:22,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:22:22,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:22:22,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:22:22,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:22:22,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:22:22,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:22:22,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:22:22,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:22:22,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:22:22,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:22:22,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:22:22,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:22:22,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:22:22,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:22:22,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:22:22,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:22:22,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:22:22,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:22:22,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:22:22,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:22:22,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:22:22,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:22:22,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:22:22,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:22:22,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:22:22,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:22:22,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:22:22,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:22:22,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:22:22,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:22:22,544 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:22:22,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:22:22,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:22:22,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:22:22,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:22:22,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:22:22,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:22:22,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:22:22,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:22:22,548 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:22:22,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:22:22,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:22:22,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:22:22,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:22:22,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:22:22,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:22:22,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:22:22,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:22:22,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:22:22,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:22:22,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:22:22,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:22:22,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:22:22,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:22:22,555 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:22:22,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:22:22,555 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/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_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2022-11-25 17:22:22,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:22:23,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:22:23,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:22:23,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:22:23,016 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:22:23,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-11-25 17:22:26,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:22:27,226 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:22:27,227 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-11-25 17:22:27,235 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/data/85c37daba/5aad7b812acb46cd96b0cff2e4c13d48/FLAGea39e4962 [2022-11-25 17:22:27,266 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/data/85c37daba/5aad7b812acb46cd96b0cff2e4c13d48 [2022-11-25 17:22:27,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:22:27,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:22:27,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:22:27,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:22:27,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:22:27,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bc1d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27, skipping insertion in model container [2022-11-25 17:22:27,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:22:27,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:22:27,515 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_2f10b920-ab85-4621-a1fb-00596644c234/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-11-25 17:22:27,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:22:27,566 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:22:27,582 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_2f10b920-ab85-4621-a1fb-00596644c234/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-11-25 17:22:27,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:22:27,618 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:22:27,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27 WrapperNode [2022-11-25 17:22:27,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:22:27,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:22:27,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:22:27,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:22:27,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,672 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-11-25 17:22:27,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:22:27,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:22:27,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:22:27,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:22:27,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,728 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:22:27,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:22:27,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:22:27,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:22:27,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (1/1) ... [2022-11-25 17:22:27,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:22:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:22:27,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:22:27,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:22:27,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:22:27,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:22:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:22:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:22:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:22:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:22:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:22:27,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:22:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:22:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 17:22:27,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 17:22:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:22:28,023 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:22:28,026 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:22:28,438 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:22:28,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:22:28,449 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-25 17:22:28,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:22:28 BoogieIcfgContainer [2022-11-25 17:22:28,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:22:28,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:22:28,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:22:28,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:22:28,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:22:27" (1/3) ... [2022-11-25 17:22:28,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d84fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:22:28, skipping insertion in model container [2022-11-25 17:22:28,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:27" (2/3) ... [2022-11-25 17:22:28,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d84fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:22:28, skipping insertion in model container [2022-11-25 17:22:28,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:22:28" (3/3) ... [2022-11-25 17:22:28,463 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-11-25 17:22:28,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:22:28,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:22:28,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:22:28,565 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;@69e4c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:22:28,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:22:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:22:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:22:28,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:22:28,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:22:28,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:22:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:22:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash -750888739, now seen corresponding path program 1 times [2022-11-25 17:22:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:22:28,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040948157] [2022-11-25 17:22:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:22:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:22:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:22:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:22:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:22:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:22:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:22:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040948157] [2022-11-25 17:22:28,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040948157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:22:28,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:22:28,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:22:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890070509] [2022-11-25 17:22:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:22:28,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:22:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:22:29,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:22:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:22:29,035 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:22:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:22:29,119 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-11-25 17:22:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:22:29,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-25 17:22:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:22:29,132 INFO L225 Difference]: With dead ends: 81 [2022-11-25 17:22:29,133 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 17:22:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:22:29,141 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:22:29,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:22:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 17:22:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 17:22:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:22:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-25 17:22:29,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-11-25 17:22:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:22:29,195 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-25 17:22:29,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:22:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-25 17:22:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:22:29,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:22:29,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:22:29,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:22:29,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:22:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:22:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 221792227, now seen corresponding path program 1 times [2022-11-25 17:22:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:22:29,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903299353] [2022-11-25 17:22:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:22:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:22:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:22:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:22:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:22:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:22:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:22:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903299353] [2022-11-25 17:22:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903299353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:22:29,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:22:29,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:22:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245363838] [2022-11-25 17:22:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:22:29,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:22:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:22:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:22:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:22:29,876 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:22:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:22:30,205 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-11-25 17:22:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:22:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-25 17:22:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:22:30,209 INFO L225 Difference]: With dead ends: 97 [2022-11-25 17:22:30,209 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 17:22:30,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:22:30,211 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 73 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:22:30,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 256 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:22:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 17:22:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-11-25 17:22:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:22:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-11-25 17:22:30,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2022-11-25 17:22:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:22:30,226 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-11-25 17:22:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:22:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-11-25 17:22:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 17:22:30,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:22:30,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:22:30,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:22:30,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:22:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:22:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 747513669, now seen corresponding path program 1 times [2022-11-25 17:22:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:22:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467297455] [2022-11-25 17:22:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:22:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:22:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:22:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:22:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:22:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 17:22:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:22:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467297455] [2022-11-25 17:22:31,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467297455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:22:31,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866423564] [2022-11-25 17:22:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:22:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:22:31,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:22:31,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:22:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 17:22:31,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:22:31,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 17:22:31,778 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 7 treesize of output 6 [2022-11-25 17:22:31,896 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:22:31,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:22:31,923 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_45 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_45))) is different from true [2022-11-25 17:22:31,967 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 13 treesize of output 15 [2022-11-25 17:22:32,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 13 treesize of output 15 [2022-11-25 17:22:32,064 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 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 17:22:32,177 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 39 treesize of output 33 [2022-11-25 17:22:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-25 17:22:32,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:23:00,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_46 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2022-11-25 17:23:02,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866423564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:02,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:23:02,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 21 [2022-11-25 17:23:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139381271] [2022-11-25 17:23:02,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:23:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 17:23:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 17:23:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=429, Unknown=20, NotChecked=86, Total=600 [2022-11-25 17:23:02,926 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 17:23:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:03,739 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-11-25 17:23:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:23:03,741 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-11-25 17:23:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:03,742 INFO L225 Difference]: With dead ends: 46 [2022-11-25 17:23:03,742 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 17:23:03,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=223, Invalid=1097, Unknown=20, NotChecked=142, Total=1482 [2022-11-25 17:23:03,745 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:03,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 228 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 268 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2022-11-25 17:23:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 17:23:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-11-25 17:23:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-11-25 17:23:03,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 39 [2022-11-25 17:23:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:03,758 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-11-25 17:23:03,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 17:23:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-11-25 17:23:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 17:23:03,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:03,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:03,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:23:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:03,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1715230204, now seen corresponding path program 1 times [2022-11-25 17:23:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:03,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117244071] [2022-11-25 17:23:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:23:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117244071] [2022-11-25 17:23:04,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117244071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993904487] [2022-11-25 17:23:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:04,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:23:04,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:23:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:04,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:23:04,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:23:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:23:04,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:23:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:23:04,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993904487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:23:04,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:23:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-25 17:23:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241708828] [2022-11-25 17:23:04,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:23:04,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:23:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:23:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:23:04,672 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:05,069 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2022-11-25 17:23:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:23:05,070 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-11-25 17:23:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:05,072 INFO L225 Difference]: With dead ends: 113 [2022-11-25 17:23:05,072 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 17:23:05,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:23:05,074 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:05,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 17:23:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 43. [2022-11-25 17:23:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-11-25 17:23:05,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 43 [2022-11-25 17:23:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:05,101 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-11-25 17:23:05,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-11-25 17:23:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:23:05,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:05,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:05,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:23:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:05,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1080974370, now seen corresponding path program 2 times [2022-11-25 17:23:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945805185] [2022-11-25 17:23:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 17:23:05,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:05,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945805185] [2022-11-25 17:23:05,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945805185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812561163] [2022-11-25 17:23:05,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:23:05,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:05,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:05,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:23:05,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:23:05,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:23:05,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:23:05,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 17:23:05,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:23:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:23:05,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:23:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812561163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:23:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-25 17:23:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015346234] [2022-11-25 17:23:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:23:05,862 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:06,029 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-11-25 17:23:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:06,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-11-25 17:23:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:06,031 INFO L225 Difference]: With dead ends: 63 [2022-11-25 17:23:06,031 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 17:23:06,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:23:06,033 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:06,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:23:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 17:23:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-11-25 17:23:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-25 17:23:06,046 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 45 [2022-11-25 17:23:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:06,047 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-25 17:23:06,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-25 17:23:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:23:06,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:06,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:06,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 17:23:06,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:06,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122647, now seen corresponding path program 1 times [2022-11-25 17:23:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:06,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542334863] [2022-11-25 17:23:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:23:06,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:06,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542334863] [2022-11-25 17:23:06,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542334863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812812674] [2022-11-25 17:23:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:06,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:06,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:06,382 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:06,442 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-11-25 17:23:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-25 17:23:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:06,448 INFO L225 Difference]: With dead ends: 62 [2022-11-25 17:23:06,449 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 17:23:06,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:06,452 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:06,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:23:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 17:23:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-25 17:23:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-25 17:23:06,480 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 48 [2022-11-25 17:23:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:06,480 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-25 17:23:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-25 17:23:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 17:23:06,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:06,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:06,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:23:06,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1397539149, now seen corresponding path program 1 times [2022-11-25 17:23:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346455789] [2022-11-25 17:23:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:23:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346455789] [2022-11-25 17:23:06,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346455789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506694272] [2022-11-25 17:23:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:06,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:23:06,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:23:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:23:07,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:23:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:23:07,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:23:07,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506694272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:07,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:23:07,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2022-11-25 17:23:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49964134] [2022-11-25 17:23:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:07,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:23:07,130 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:07,223 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-11-25 17:23:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-11-25 17:23:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:07,229 INFO L225 Difference]: With dead ends: 58 [2022-11-25 17:23:07,229 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 17:23:07,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:23:07,235 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:07,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:23:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 17:23:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-11-25 17:23:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-11-25 17:23:07,258 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 49 [2022-11-25 17:23:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:07,258 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-11-25 17:23:07,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-11-25 17:23:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 17:23:07,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:07,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:07,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:23:07,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:07,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1418623757, now seen corresponding path program 1 times [2022-11-25 17:23:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:07,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354924041] [2022-11-25 17:23:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:07,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:23:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:07,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354924041] [2022-11-25 17:23:07,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354924041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:07,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667746241] [2022-11-25 17:23:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:07,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:07,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:07,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:23:07,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:23:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:07,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:23:07,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:23:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:23:08,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:23:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:23:08,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667746241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:23:08,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:23:08,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2022-11-25 17:23:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187423611] [2022-11-25 17:23:08,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:23:08,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:23:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:23:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:23:08,285 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:08,896 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2022-11-25 17:23:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:23:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-25 17:23:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:08,899 INFO L225 Difference]: With dead ends: 96 [2022-11-25 17:23:08,899 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 17:23:08,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:23:08,901 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:08,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 318 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:23:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 17:23:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2022-11-25 17:23:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:23:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-11-25 17:23:08,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 52 [2022-11-25 17:23:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:08,926 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-11-25 17:23:08,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:23:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-11-25 17:23:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:23:08,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:08,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:08,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:23:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:09,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:23:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -282483074, now seen corresponding path program 1 times [2022-11-25 17:23:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:09,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81878114] [2022-11-25 17:23:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:23:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:23:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:23:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:23:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:23:09,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:09,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81878114] [2022-11-25 17:23:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81878114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:23:09,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695277026] [2022-11-25 17:23:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:23:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:09,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:23:09,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:23:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:09,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-25 17:23:09,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:23:09,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 17:23:09,821 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 7 treesize of output 6 [2022-11-25 17:23:09,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:23:09,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:23:10,001 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-25 17:23:10,094 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 32 [2022-11-25 17:23:10,196 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 32 [2022-11-25 17:23:10,505 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 56 treesize of output 50 [2022-11-25 17:23:10,842 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2022-11-25 17:23:11,110 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 90 treesize of output 84 [2022-11-25 17:23:12,013 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 178 treesize of output 166 [2022-11-25 17:23:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:23:12,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:24:52,116 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse2 (store (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse4 .cse5)))) (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select .cse2 .cse3)))) .cse3 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-11-25 17:25:16,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1| Int)) (or (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))))))) (let ((.cse0 (let ((.cse4 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))))) (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (< |c_ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-11-25 17:25:18,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| 4 .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse7))))))) (let ((.cse0 (let ((.cse4 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-11-25 17:25:20,932 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8)))))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse4) (select .cse3 .cse1)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-11-25 17:25:23,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (< 2 |ULTIMATE.start_main_~n~0#1|) (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_check_~a0#1.offset|))))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (not (< 1 |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-11-25 17:25:25,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse7 (let ((.cse8 ((as const (Array Int Int)) 0))) (store .cse8 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_check_~a0#1.offset|))))) (< 2 |ULTIMATE.start_main_~n~0#1|) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (not (< 1 |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-11-25 17:25:25,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695277026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:25,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:25:25,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27] total 34 [2022-11-25 17:25:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884040196] [2022-11-25 17:25:25,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:25:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:25:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2035, Unknown=48, NotChecked=582, Total=2862 [2022-11-25 17:25:25,206 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 17:25:32,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:25:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:35,709 INFO L93 Difference]: Finished difference Result 187 states and 229 transitions. [2022-11-25 17:25:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 17:25:35,710 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-11-25 17:25:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:35,711 INFO L225 Difference]: With dead ends: 187 [2022-11-25 17:25:35,711 INFO L226 Difference]: Without dead ends: 164 [2022-11-25 17:25:35,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 139.3s TimeCoverageRelationStatistics Valid=1205, Invalid=7701, Unknown=48, NotChecked=1146, Total=10100 [2022-11-25 17:25:35,715 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 525 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 106 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:35,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 472 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1226 Invalid, 3 Unknown, 0 Unchecked, 4.8s Time] [2022-11-25 17:25:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-25 17:25:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 83. [2022-11-25 17:25:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:25:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-11-25 17:25:35,762 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 53 [2022-11-25 17:25:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:35,763 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-11-25 17:25:35,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 17:25:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-11-25 17:25:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:25:35,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:35,764 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:35,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 17:25:35,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:35,972 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1645706784, now seen corresponding path program 2 times [2022-11-25 17:25:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512422824] [2022-11-25 17:25:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:25:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:25:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:25:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:25:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:25:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:36,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512422824] [2022-11-25 17:25:36,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512422824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:36,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823919994] [2022-11-25 17:25:36,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:25:36,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:36,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:36,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:25:36,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:25:36,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:36,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:25:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:25:36,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:25:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823919994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:36,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:25:36,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-11-25 17:25:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256681525] [2022-11-25 17:25:36,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:36,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:25:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:25:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:25:36,705 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:37,330 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-11-25 17:25:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 17:25:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-25 17:25:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:37,331 INFO L225 Difference]: With dead ends: 145 [2022-11-25 17:25:37,332 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 17:25:37,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2022-11-25 17:25:37,333 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 184 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:37,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 367 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:25:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 17:25:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-11-25 17:25:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:25:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2022-11-25 17:25:37,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 55 [2022-11-25 17:25:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:37,366 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2022-11-25 17:25:37,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-11-25 17:25:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 17:25:37,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:37,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:37,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:37,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:25:37,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 576449656, now seen corresponding path program 3 times [2022-11-25 17:25:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:37,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576088928] [2022-11-25 17:25:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:25:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:25:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:25:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:25:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:25:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:37,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576088928] [2022-11-25 17:25:37,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576088928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:37,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983560973] [2022-11-25 17:25:37,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:25:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:37,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:37,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:25:37,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:25:37,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:37,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 17:25:37,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:25:38,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:25:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983560973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:38,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:25:38,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2022-11-25 17:25:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64034921] [2022-11-25 17:25:38,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 17:25:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:25:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2022-11-25 17:25:38,815 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 17:25:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:40,346 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2022-11-25 17:25:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:25:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 56 [2022-11-25 17:25:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:40,348 INFO L225 Difference]: With dead ends: 151 [2022-11-25 17:25:40,348 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 17:25:40,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 17:25:40,350 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 198 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:40,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 605 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:25:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 17:25:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2022-11-25 17:25:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 91 states have internal predecessors, (110), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:25:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-11-25 17:25:40,392 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 56 [2022-11-25 17:25:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:40,393 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-11-25 17:25:40,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 17:25:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-11-25 17:25:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:25:40,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:40,394 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:40,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 17:25:40,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:40,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 116417284, now seen corresponding path program 1 times [2022-11-25 17:25:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:40,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374623062] [2022-11-25 17:25:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:25:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:25:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:25:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:25:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:25:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:40,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374623062] [2022-11-25 17:25:40,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374623062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:40,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135586243] [2022-11-25 17:25:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:40,892 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:40,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:25:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:41,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:25:41,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:25:41,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:25:41,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135586243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:41,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:25:41,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-11-25 17:25:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701202980] [2022-11-25 17:25:41,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:41,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 17:25:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 17:25:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:25:41,271 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:41,656 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2022-11-25 17:25:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:25:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-11-25 17:25:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:41,659 INFO L225 Difference]: With dead ends: 139 [2022-11-25 17:25:41,659 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:25:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:25:41,663 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:41,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 419 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:25:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:25:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2022-11-25 17:25:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 72 states have internal predecessors, (85), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:25:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-11-25 17:25:41,708 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2022-11-25 17:25:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:41,708 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-11-25 17:25:41,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-11-25 17:25:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 17:25:41,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:41,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:41,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:41,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 17:25:41,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -4426440, now seen corresponding path program 2 times [2022-11-25 17:25:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197912409] [2022-11-25 17:25:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:25:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:42,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:25:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:25:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:25:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:25:42,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:42,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197912409] [2022-11-25 17:25:42,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197912409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:42,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189266065] [2022-11-25 17:25:42,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:25:42,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:42,152 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:42,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:25:42,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:25:42,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:42,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:25:42,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:25:42,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:25:42,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189266065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:42,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:25:42,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 11 [2022-11-25 17:25:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735416761] [2022-11-25 17:25:42,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:25:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:25:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:25:42,527 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:42,707 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-11-25 17:25:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:25:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-11-25 17:25:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:42,710 INFO L225 Difference]: With dead ends: 105 [2022-11-25 17:25:42,711 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 17:25:42,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:25:42,712 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:42,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 220 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:25:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 17:25:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-25 17:25:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:25:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-11-25 17:25:42,747 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 61 [2022-11-25 17:25:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:42,747 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-11-25 17:25:42,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:25:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-11-25 17:25:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 17:25:42,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:42,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:42,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:42,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:42,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:25:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 108996138, now seen corresponding path program 3 times [2022-11-25 17:25:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854701771] [2022-11-25 17:25:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:25:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:25:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:25:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:25:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 17:25:43,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854701771] [2022-11-25 17:25:43,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854701771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774046908] [2022-11-25 17:25:43,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:25:43,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:43,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:43,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:43,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:25:43,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 17:25:43,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:25:43,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-25 17:25:43,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:43,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 17:25:43,956 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 7 treesize of output 6 [2022-11-25 17:25:44,052 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:25:44,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:25:44,137 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-25 17:25:44,245 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 32 [2022-11-25 17:25:44,351 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 28 treesize of output 26 [2022-11-25 17:25:44,443 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 35 treesize of output 33 [2022-11-25 17:26:01,060 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-11-25 17:26:01,246 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-11-25 17:26:01,754 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 50 treesize of output 48 [2022-11-25 17:26:02,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-11-25 17:26:02,470 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 98 treesize of output 90 [2022-11-25 17:26:09,173 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 178 treesize of output 160 [2022-11-25 17:26:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:26:09,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:28:54,779 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~1#1| 1) |v_ULTIMATE.start_main_~i~1#1_43|)) (forall ((v_ArrVal_454 Int) (|v_ULTIMATE.start_downsweep_~n#1_13| Int) (|aux_mod_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_450 Int) (|aux_div_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_449 Int) (v_ArrVal_447 Int) (|v_ULTIMATE.start_main_~i~1#1_42| Int) (v_ArrVal_457 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |c_ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_447) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_42| 4)) v_ArrVal_449))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2 v_ArrVal_450) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_downsweep_~n#1_13| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_457)) (.cse4 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 8) (* 16 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))) (let ((.cse5 (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 8) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 4))) (.cse6 (select .cse3 .cse4))) (store (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6)) .cse5 .cse6))))) (or (>= |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2) (< 0 |aux_div_ULTIMATE.start_downsweep_~space#1_43|) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse1 .cse2)) (not (< (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 4) (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2)) (+ |v_ULTIMATE.start_downsweep_~n#1_13| 1))) (not (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< |v_ULTIMATE.start_main_~i~1#1_42| 2) (not (< 0 (+ |aux_mod_ULTIMATE.start_downsweep_~space#1_43| (* 2 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))))))))) is different from false [2022-11-25 17:28:56,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (|v_ULTIMATE.start_downsweep_~n#1_13| Int) (|aux_mod_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_450 Int) (|aux_div_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_449 Int) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_447 Int) (|v_ULTIMATE.start_main_~i~1#1_42| Int) (v_ArrVal_457 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |c_ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_447) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_42| 4)) v_ArrVal_449))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2 v_ArrVal_450) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_downsweep_~n#1_13| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_457)) (.cse4 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 8) (* 16 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))) (let ((.cse6 (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 8) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 4))) (.cse5 (select .cse3 .cse4))) (store (store .cse3 .cse4 (+ .cse5 (select .cse3 .cse6))) .cse6 .cse5))))) (or (>= |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< 0 |aux_div_ULTIMATE.start_downsweep_~space#1_43|) (not (<= (+ |c_ULTIMATE.start_main_~i~1#1| 1) |v_ULTIMATE.start_main_~i~1#1_43|)) (not (< (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 4) (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2)) (+ |v_ULTIMATE.start_downsweep_~n#1_13| 1))) (< |v_ULTIMATE.start_main_~i~1#1_42| 2) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse0 .cse2)) (not (< 0 (+ |aux_mod_ULTIMATE.start_downsweep_~space#1_43| (* 2 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))))))) is different from false [2022-11-25 17:29:03,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774046908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:29:03,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:29:03,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 38] total 45 [2022-11-25 17:29:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791886415] [2022-11-25 17:29:03,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:29:03,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-25 17:29:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:29:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-25 17:29:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=4485, Unknown=72, NotChecked=274, Total=5112 [2022-11-25 17:29:03,032 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 17:29:08,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:29:53,030 WARN L233 SmtUtils]: Spent 11.32s on a formula simplification. DAG size of input: 94 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:30:00,105 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 100 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:30:09,993 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 91 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:30:18,586 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 97 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:30:20,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:22,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:29,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:40,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:41,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:42,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:51,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:52,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:54,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:30:58,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:00,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:09,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:11,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:12,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:15,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:17,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:19,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:31:35,716 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 138 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:31:47,648 WARN L233 SmtUtils]: Spent 9.60s on a formula simplification. DAG size of input: 135 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:31:58,543 WARN L233 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 120 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:32:06,227 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:32:18,238 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 135 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:32:31,052 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 132 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:32:43,040 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 117 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:32:45,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:32:57,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:33:09,784 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 158 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:33:20,798 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 165 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:33:23,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:33:26,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:33:38,528 WARN L233 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 161 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:33:41,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:33:49,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:33:59,657 WARN L233 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 162 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:34:01,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:10,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:12,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:14,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:16,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:30,322 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 158 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:34:32,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:35,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:34:45,294 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:34:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:45,390 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2022-11-25 17:34:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-25 17:34:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-11-25 17:34:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:45,392 INFO L225 Difference]: With dead ends: 167 [2022-11-25 17:34:45,392 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 17:34:45,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2994 ImplicationChecksByTransitivity, 463.6s TimeCoverageRelationStatistics Valid=2196, Invalid=14238, Unknown=86, NotChecked=510, Total=17030 [2022-11-25 17:34:45,397 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 827 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 194 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:45,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 472 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2242 Invalid, 37 Unknown, 0 Unchecked, 74.3s Time] [2022-11-25 17:34:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 17:34:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2022-11-25 17:34:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:34:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-25 17:34:45,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 64 [2022-11-25 17:34:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:45,457 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-25 17:34:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 17:34:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-25 17:34:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 17:34:45,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:45,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:45,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:34:45,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:45,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:34:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1177879933, now seen corresponding path program 4 times [2022-11-25 17:34:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:45,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045762612] [2022-11-25 17:34:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:34:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:34:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:34:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:34:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 17:34:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045762612] [2022-11-25 17:34:46,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045762612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131885924] [2022-11-25 17:34:46,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:34:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:46,112 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:46,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:34:46,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:34:46,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:34:46,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:34:46,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 17:34:46,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 17:34:46,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131885924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:34:46,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:34:46,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 19 [2022-11-25 17:34:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710833374] [2022-11-25 17:34:46,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:34:46,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:34:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:34:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:34:46,798 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:34:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:47,851 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2022-11-25 17:34:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:34:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2022-11-25 17:34:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:47,853 INFO L225 Difference]: With dead ends: 194 [2022-11-25 17:34:47,853 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 17:34:47,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 133 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 17:34:47,855 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 218 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:47,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 516 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:34:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 17:34:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 122. [2022-11-25 17:34:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:34:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-11-25 17:34:47,907 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 70 [2022-11-25 17:34:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:47,908 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-11-25 17:34:47,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:34:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-11-25 17:34:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 17:34:47,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:47,910 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:47,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 17:34:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:34:48,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:34:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1338998268, now seen corresponding path program 5 times [2022-11-25 17:34:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143564308] [2022-11-25 17:34:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:34:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:34:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:34:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:34:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:34:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143564308] [2022-11-25 17:34:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143564308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022304936] [2022-11-25 17:34:48,755 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:34:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:48,757 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:48,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:34:49,809 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-25 17:34:49,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:34:49,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 17:34:49,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:34:50,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:34:50,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022304936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:34:50,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:34:50,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-11-25 17:34:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417686981] [2022-11-25 17:34:50,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:34:50,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 17:34:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 17:34:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 17:34:50,626 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:34:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:54,747 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-11-25 17:34:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 17:34:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2022-11-25 17:34:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:54,753 INFO L225 Difference]: With dead ends: 233 [2022-11-25 17:34:54,753 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 17:34:54,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=885, Invalid=4815, Unknown=0, NotChecked=0, Total=5700 [2022-11-25 17:34:54,756 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 616 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:54,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 955 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 17:34:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 17:34:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 142. [2022-11-25 17:34:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2272727272727273) internal successors, (162), 132 states have internal predecessors, (162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:34:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-11-25 17:34:54,860 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 71 [2022-11-25 17:34:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:54,860 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-11-25 17:34:54,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:34:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-11-25 17:34:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 17:34:54,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:54,862 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:54,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:34:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:34:55,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:34:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1370992095, now seen corresponding path program 6 times [2022-11-25 17:34:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675940417] [2022-11-25 17:34:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:34:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:34:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:34:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:34:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:34:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:56,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675940417] [2022-11-25 17:34:56,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675940417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:56,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021121854] [2022-11-25 17:34:56,020 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:34:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:56,025 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:56,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f10b920-ab85-4621-a1fb-00596644c234/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:34:56,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-25 17:34:56,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:34:56,369 WARN L261 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-25 17:34:56,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:56,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 17:34:56,606 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 7 treesize of output 6 [2022-11-25 17:34:56,723 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:34:56,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:34:56,766 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_638 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_638) |c_#memory_int|)) is different from true [2022-11-25 17:34:56,779 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 13 treesize of output 15 [2022-11-25 17:34:56,828 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 13 treesize of output 15 [2022-11-25 17:34:56,852 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 30 treesize of output 28 [2022-11-25 17:34:56,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 17:34:56,965 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 50 treesize of output 46 [2022-11-25 17:34:56,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-11-25 17:34:57,134 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 70 treesize of output 64 [2022-11-25 17:34:57,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:34:57,145 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 66 [2022-11-25 17:34:57,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2022-11-25 17:34:58,048 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2022-11-25 17:34:58,576 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 101 treesize of output 95 [2022-11-25 17:34:59,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2022-11-25 17:34:59,810 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-11-25 17:35:00,730 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 238 [2022-11-25 17:35:01,121 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 549 treesize of output 541 [2022-11-25 17:35:04,904 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 796 treesize of output 776 [2022-11-25 17:35:04,945 INFO L321 Elim1Store]: treesize reduction 28, result has 9.7 percent of original size [2022-11-25 17:35:04,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2837 treesize of output 2812 [2022-11-25 17:35:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-25 17:35:05,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:59,837 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_662 Int) (|v_ULTIMATE.start_downsweep_~space#1_39| Int) (v_ArrVal_639 (Array Int Int)) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_downsweep_~n#1_16| Int) (v_ArrVal_657 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse12 (store v_ArrVal_639 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse12 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset| 8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (let ((.cse3 (let ((.cse7 (+ (- 4) (* |v_ULTIMATE.start_downsweep_~space#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse5 (let ((.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (store (store (let ((.cse11 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 .cse1 (+ (select .cse11 .cse1) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse9 v_ArrVal_651) (+ (* |v_ULTIMATE.start_downsweep_~n#1_16| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653))) (let ((.cse10 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse1) .cse10)) .cse1 .cse10))))) (.cse6 (+ (- 4) (* 8 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse7) (select .cse5 .cse6)))) .cse7 v_ArrVal_657))) (.cse4 (+ (* 16 |v_ULTIMATE.start_downsweep_~space#1_39|) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse4 v_ArrVal_662) (+ (- 4) (* 12 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4)))))) (not (< 0 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 2 (* 2 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 1 |ULTIMATE.start_main_~i~1#1|) (< (+ 3 |ULTIMATE.start_main_~i~1#1|) |v_ULTIMATE.start_downsweep_~n#1_16|) (not (< 3 |v_ULTIMATE.start_downsweep_~n#1_16|)))) is different from false [2022-11-25 17:36:00,058 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_662 Int) (|v_ULTIMATE.start_downsweep_~space#1_39| Int) (v_ArrVal_639 (Array Int Int)) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_downsweep_~n#1_16| Int) (v_ArrVal_657 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse12 (store v_ArrVal_639 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse12 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset| 8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (let ((.cse3 (let ((.cse7 (+ (- 4) (* |v_ULTIMATE.start_downsweep_~space#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse6 (+ (- 4) (* 8 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (let ((.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (store (store (let ((.cse11 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 .cse2 (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse11 .cse2)))) .cse9 v_ArrVal_651) (+ (* |v_ULTIMATE.start_downsweep_~n#1_16| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653))) (let ((.cse10 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ .cse10 (select .cse8 .cse2))) .cse2 .cse10)))))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 .cse7)))) .cse7 v_ArrVal_657))) (.cse4 (+ (* 16 |v_ULTIMATE.start_downsweep_~space#1_39|) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse4 v_ArrVal_662) (+ (- 4) (* 12 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4)) (select .cse0 .cse2))))) (not (< 0 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 2 (* 2 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 1 |ULTIMATE.start_main_~i~1#1|) (< (+ 3 |ULTIMATE.start_main_~i~1#1|) |v_ULTIMATE.start_downsweep_~n#1_16|) (not (< 3 |v_ULTIMATE.start_downsweep_~n#1_16|)))) is different from false [2022-11-25 17:36:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021121854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:36:00,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:36:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 45] total 55 [2022-11-25 17:36:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509710708] [2022-11-25 17:36:00,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:36:00,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-25 17:36:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:36:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-25 17:36:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=6733, Unknown=12, NotChecked=504, Total=7656 [2022-11-25 17:36:00,258 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 52 states have internal predecessors, (102), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7)