./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:25:39,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:25:39,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:25:39,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:25:39,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:25:39,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:25:39,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:25:39,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:25:39,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:25:39,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:25:39,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:25:39,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:25:39,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:25:39,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:25:39,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:25:39,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:25:39,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:25:39,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:25:39,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:25:39,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:25:39,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:25:39,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:25:39,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:25:39,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:25:39,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:25:39,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:25:39,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:25:39,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:25:39,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:25:39,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:25:39,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:25:39,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:25:39,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:25:39,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:25:39,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:25:39,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:25:39,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:25:39,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:25:39,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:25:39,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:25:39,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:25:39,517 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:25:39,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:25:39,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:25:39,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:25:39,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:25:39,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:25:39,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:25:39,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:25:39,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:25:39,562 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:25:39,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:25:39,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:25:39,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:25:39,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:25:39,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:25:39,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:25:39,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:25:39,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:25:39,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:25:39,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:25:39,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:39,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:25:39,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:25:39,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:25:39,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:25:39,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:25:39,566 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:25:39,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:25:39,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:25:39,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2022-11-20 11:25:39,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:25:39,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:25:39,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:25:39,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:25:39,922 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:25:39,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-properties/list-2.i [2022-11-20 11:25:43,061 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:25:43,373 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:25:43,374 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/sv-benchmarks/c/list-properties/list-2.i [2022-11-20 11:25:43,385 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/data/0fda92775/bd9aad129d654b3bbf334af15225a582/FLAG4591c5f44 [2022-11-20 11:25:43,400 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/data/0fda92775/bd9aad129d654b3bbf334af15225a582 [2022-11-20 11:25:43,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:25:43,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:25:43,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:43,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:25:43,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:25:43,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e704a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43, skipping insertion in model container [2022-11-20 11:25:43,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:25:43,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:25:43,778 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_ea5c2c3a-7f38-4567-9e07-49209ff827d7/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2022-11-20 11:25:43,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:43,795 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:25:43,835 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_ea5c2c3a-7f38-4567-9e07-49209ff827d7/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2022-11-20 11:25:43,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:43,861 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:25:43,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43 WrapperNode [2022-11-20 11:25:43,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:43,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:43,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:25:43,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:25:43,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,906 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-11-20 11:25:43,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:43,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:25:43,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:25:43,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:25:43,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:25:43,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:25:43,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:25:43,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:25:43,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (1/1) ... [2022-11-20 11:25:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:43,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:25:43,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:25:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-20 11:25:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-20 11:25:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:25:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:25:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:25:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:25:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:25:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:25:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:25:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:25:44,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:25:44,233 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:25:44,235 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:25:44,278 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-20 11:25:44,402 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:25:44,410 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:25:44,410 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 11:25:44,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:44 BoogieIcfgContainer [2022-11-20 11:25:44,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:25:44,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:25:44,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:25:44,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:25:44,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:25:43" (1/3) ... [2022-11-20 11:25:44,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e71ef13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:44, skipping insertion in model container [2022-11-20 11:25:44,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:43" (2/3) ... [2022-11-20 11:25:44,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e71ef13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:44, skipping insertion in model container [2022-11-20 11:25:44,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:44" (3/3) ... [2022-11-20 11:25:44,423 INFO L112 eAbstractionObserver]: Analyzing ICFG list-2.i [2022-11-20 11:25:44,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:25:44,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:25:44,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:25:44,506 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;@4bf191bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:25:44,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:25:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:25:44,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:44,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:44,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2022-11-20 11:25:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:44,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811687659] [2022-11-20 11:25:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:44,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811687659] [2022-11-20 11:25:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811687659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:44,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166128523] [2022-11-20 11:25:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:44,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:25:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:44,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:25:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:25:44,763 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:44,783 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-20 11:25:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:25:44,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:25:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:44,793 INFO L225 Difference]: With dead ends: 50 [2022-11-20 11:25:44,794 INFO L226 Difference]: Without dead ends: 21 [2022-11-20 11:25:44,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:25:44,801 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:44,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:25:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-20 11:25:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-20 11:25:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-20 11:25:44,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2022-11-20 11:25:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-20 11:25:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-20 11:25:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:25:44,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:44,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:25:44,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2022-11-20 11:25:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:44,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521975454] [2022-11-20 11:25:44,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521975454] [2022-11-20 11:25:45,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521975454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:45,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:45,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858439683] [2022-11-20 11:25:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:45,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:45,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:45,166 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:45,279 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-20 11:25:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:45,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 11:25:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:45,281 INFO L225 Difference]: With dead ends: 46 [2022-11-20 11:25:45,282 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 11:25:45,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:25:45,284 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:45,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 11:25:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-11-20 11:25:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-20 11:25:45,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2022-11-20 11:25:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:45,294 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-20 11:25:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-20 11:25:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:25:45,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:45,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:25:45,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2022-11-20 11:25:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:45,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476939006] [2022-11-20 11:25:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:45,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476939006] [2022-11-20 11:25:45,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476939006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:45,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:45,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573552822] [2022-11-20 11:25:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:45,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:45,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:45,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:45,655 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:45,824 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-20 11:25:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 11:25:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:45,827 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:25:45,829 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:25:45,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:25:45,831 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:45,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:25:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-20 11:25:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-20 11:25:45,851 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-11-20 11:25:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:45,851 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-20 11:25:45,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-20 11:25:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:25:45,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:45,853 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:25:45,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2022-11-20 11:25:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:45,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422465216] [2022-11-20 11:25:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422465216] [2022-11-20 11:25:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422465216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402166941] [2022-11-20 11:25:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:46,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:46,079 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:46,192 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-20 11:25:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 11:25:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:46,193 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:25:46,194 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:25:46,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:25:46,195 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:46,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:25:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-11-20 11:25:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-20 11:25:46,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-11-20 11:25:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:46,206 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-20 11:25:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-20 11:25:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:25:46,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:46,209 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:25:46,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2022-11-20 11:25:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047393316] [2022-11-20 11:25:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:46,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047393316] [2022-11-20 11:25:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047393316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:46,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189697445] [2022-11-20 11:25:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:46,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:46,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:46,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:46,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:25:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:46,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 11:25:46,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:46,715 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-20 11:25:46,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:46,853 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:46,854 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-20 11:25:46,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:46,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:25:46,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:46,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:47,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:47,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:47,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-20 11:25:47,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:47,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-20 11:25:47,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 11:25:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:47,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189697445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:47,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:47,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-20 11:25:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391259992] [2022-11-20 11:25:47,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:47,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:25:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:25:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=211, Unknown=8, NotChecked=0, Total=272 [2022-11-20 11:25:47,310 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:47,565 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-20 11:25:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:25:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:25:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:47,566 INFO L225 Difference]: With dead ends: 50 [2022-11-20 11:25:47,567 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 11:25:47,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=380, Unknown=9, NotChecked=0, Total=506 [2022-11-20 11:25:47,568 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 122 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:47,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 82 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 91 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-11-20 11:25:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 11:25:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-11-20 11:25:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-20 11:25:47,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2022-11-20 11:25:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:47,576 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-20 11:25:47,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-20 11:25:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:25:47,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:47,577 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:47,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:47,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:47,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2022-11-20 11:25:47,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:47,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415804045] [2022-11-20 11:25:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:47,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415804045] [2022-11-20 11:25:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415804045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279325025] [2022-11-20 11:25:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:48,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:48,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:48,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:25:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:48,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 11:25:48,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:48,169 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-20 11:25:48,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:48,237 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-20 11:25:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:48,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:48,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:25:48,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:48,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:48,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:48,421 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-20 11:25:48,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:48,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-20 11:25:48,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:48,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-20 11:25:48,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 11:25:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:25:48,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279325025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:48,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:48,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-20 11:25:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308453230] [2022-11-20 11:25:48,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:48,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:25:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:25:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=191, Unknown=2, NotChecked=28, Total=272 [2022-11-20 11:25:48,652 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:48,925 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-20 11:25:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:25:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 11:25:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:48,927 INFO L225 Difference]: With dead ends: 70 [2022-11-20 11:25:48,927 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 11:25:48,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=288, Unknown=2, NotChecked=36, Total=420 [2022-11-20 11:25:48,929 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:48,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 173 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-11-20 11:25:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 11:25:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2022-11-20 11:25:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-11-20 11:25:48,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2022-11-20 11:25:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:48,942 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-11-20 11:25:48,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-11-20 11:25:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:25:48,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:48,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:48,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:49,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:25:49,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 242294851, now seen corresponding path program 1 times [2022-11-20 11:25:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:49,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047578430] [2022-11-20 11:25:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:49,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047578430] [2022-11-20 11:25:49,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047578430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:49,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683726155] [2022-11-20 11:25:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:49,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:49,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:49,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:49,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:25:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:49,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 11:25:49,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:49,704 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-20 11:25:49,768 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:49,768 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-20 11:25:49,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:49,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:49,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:25:49,868 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-20 11:25:49,873 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 34 treesize of output 36 [2022-11-20 11:25:49,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 11:25:49,915 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 31 treesize of output 19 [2022-11-20 11:25:49,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2022-11-20 11:25:49,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:49,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:49,971 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 79 treesize of output 57 [2022-11-20 11:25:49,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_189 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-20 11:25:50,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:50,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 11:25:50,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:50,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:25:50,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:25:50,036 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:25:50,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-20 11:25:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:25:50,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683726155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:50,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:50,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-11-20 11:25:50,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090049777] [2022-11-20 11:25:50,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:50,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:25:50,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:25:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2022-11-20 11:25:50,170 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:50,456 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-20 11:25:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:25:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:25:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:50,457 INFO L225 Difference]: With dead ends: 55 [2022-11-20 11:25:50,458 INFO L226 Difference]: Without dead ends: 51 [2022-11-20 11:25:50,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2022-11-20 11:25:50,459 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:50,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 104 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-11-20 11:25:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-20 11:25:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-11-20 11:25:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-20 11:25:50,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-11-20 11:25:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:50,480 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-20 11:25:50,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-20 11:25:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:25:50,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:50,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:50,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:50,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:50,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 965794270, now seen corresponding path program 1 times [2022-11-20 11:25:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:50,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114604974] [2022-11-20 11:25:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:50,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114604974] [2022-11-20 11:25:51,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114604974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:51,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811615269] [2022-11-20 11:25:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:51,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:51,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:25:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:51,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 11:25:51,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:51,259 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-20 11:25:51,327 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:51,328 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-20 11:25:51,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:51,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:51,415 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:25:51,416 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-20 11:25:51,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 11:25:51,427 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 26 treesize of output 28 [2022-11-20 11:25:51,471 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 31 treesize of output 19 [2022-11-20 11:25:51,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2022-11-20 11:25:51,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:51,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:51,566 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 52 treesize of output 30 [2022-11-20 11:25:51,576 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-20 11:25:51,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:51,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 11:25:51,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:51,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-20 11:25:51,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:51,640 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:25:51,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-20 11:25:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:25:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811615269] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:51,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-11-20 11:25:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216735896] [2022-11-20 11:25:51,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:51,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:25:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:25:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2022-11-20 11:25:51,777 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:52,157 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-20 11:25:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:25:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:25:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:52,160 INFO L225 Difference]: With dead ends: 65 [2022-11-20 11:25:52,160 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 11:25:52,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=444, Unknown=1, NotChecked=44, Total=600 [2022-11-20 11:25:52,161 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:52,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 151 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 189 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2022-11-20 11:25:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 11:25:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2022-11-20 11:25:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-20 11:25:52,177 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2022-11-20 11:25:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:52,178 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-20 11:25:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-20 11:25:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:25:52,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:52,181 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:52,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:52,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:52,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 2 times [2022-11-20 11:25:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:52,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136802822] [2022-11-20 11:25:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136802822] [2022-11-20 11:25:52,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136802822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997892381] [2022-11-20 11:25:52,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:52,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:52,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:25:52,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:52,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:52,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:25:52,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:52,821 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-20 11:25:52,892 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:52,893 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-20 11:25:52,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:25:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:25:52,994 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:25:52,995 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-20 11:25:52,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-20 11:25:53,004 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 32 treesize of output 34 [2022-11-20 11:25:53,042 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 21 [2022-11-20 11:25:53,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-20 11:25:53,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:53,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:53,122 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 52 treesize of output 30 [2022-11-20 11:25:53,130 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_293 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-20 11:25:53,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:53,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 11:25:53,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:53,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-20 11:25:53,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:53,187 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:25:53,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-20 11:25:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:25:53,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997892381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:53,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:53,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-20 11:25:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816782729] [2022-11-20 11:25:53,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:53,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:25:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:25:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-11-20 11:25:53,314 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:53,771 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-11-20 11:25:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:25:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:25:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:53,772 INFO L225 Difference]: With dead ends: 58 [2022-11-20 11:25:53,772 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:25:53,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2022-11-20 11:25:53,773 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 104 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:53,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 145 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-11-20 11:25:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:25:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-20 11:25:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-20 11:25:53,778 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2022-11-20 11:25:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-20 11:25:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-20 11:25:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:25:53,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:53,784 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:53,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:53,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 11:25:53,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash 366447567, now seen corresponding path program 2 times [2022-11-20 11:25:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:53,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354793843] [2022-11-20 11:25:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354793843] [2022-11-20 11:25:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354793843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486879873] [2022-11-20 11:25:54,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:54,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:54,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:25:54,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:54,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:54,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 11:25:54,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:54,591 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-20 11:25:54,644 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:54,644 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-20 11:25:54,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:54,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:54,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:25:54,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:54,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:54,818 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:25:54,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:25:54,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:54,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:55,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2022-11-20 11:25:55,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-20 11:25:55,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:55,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-20 11:25:55,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:55,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-20 11:25:55,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 535 treesize of output 503 [2022-11-20 11:25:55,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 11:25:55,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:55,406 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 281 treesize of output 271 [2022-11-20 11:25:55,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2022-11-20 11:25:56,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:56,837 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 434 treesize of output 412 [2022-11-20 11:25:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:25:58,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486879873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:58,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:58,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-20 11:25:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533307369] [2022-11-20 11:25:58,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:25:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:25:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=336, Unknown=18, NotChecked=78, Total=506 [2022-11-20 11:25:58,076 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:58,211 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-20 11:25:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:25:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:25:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:58,213 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:25:58,213 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 11:25:58,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=370, Unknown=18, NotChecked=82, Total=552 [2022-11-20 11:25:58,215 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:58,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 131 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2022-11-20 11:25:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 11:25:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-20 11:25:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-20 11:25:58,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-11-20 11:25:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:58,227 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-20 11:25:58,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-20 11:25:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:25:58,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:58,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:58,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:25:58,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2022-11-20 11:25:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:58,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457251090] [2022-11-20 11:25:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:58,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457251090] [2022-11-20 11:25:58,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457251090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:58,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880481608] [2022-11-20 11:25:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:58,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:58,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:25:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:59,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 11:25:59,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:59,053 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-20 11:25:59,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:25:59,094 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:25:59,094 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-20 11:25:59,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:59,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:25:59,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:59,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:25:59,234 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:25:59,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:25:59,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:25:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:59,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:59,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-20 11:25:59,490 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-11-20 11:25:59,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:59,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-20 11:25:59,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:59,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-20 11:25:59,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 535 treesize of output 503 [2022-11-20 11:25:59,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 11:25:59,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:25:59,938 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 281 treesize of output 271 [2022-11-20 11:26:00,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2022-11-20 11:26:00,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:00,510 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 371 treesize of output 357 [2022-11-20 11:26:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:26:01,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880481608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:01,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:01,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-20 11:26:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295355774] [2022-11-20 11:26:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:01,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:26:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:26:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=336, Unknown=18, NotChecked=78, Total=506 [2022-11-20 11:26:01,046 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:01,617 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-11-20 11:26:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:26:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:26:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:01,620 INFO L225 Difference]: With dead ends: 65 [2022-11-20 11:26:01,620 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:26:01,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=741, Unknown=23, NotChecked=118, Total=1056 [2022-11-20 11:26:01,621 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 81 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:01,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 168 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 152 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-11-20 11:26:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:26:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-11-20 11:26:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-11-20 11:26:01,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 24 [2022-11-20 11:26:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:01,627 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-11-20 11:26:01,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-11-20 11:26:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:26:01,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:01,634 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:01,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:01,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1529551183, now seen corresponding path program 2 times [2022-11-20 11:26:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276790223] [2022-11-20 11:26:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:02,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276790223] [2022-11-20 11:26:02,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276790223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607445502] [2022-11-20 11:26:02,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:26:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:02,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:02,208 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:02,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:26:02,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:26:02,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:02,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 11:26:02,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:02,327 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-20 11:26:02,398 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:26:02,399 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-20 11:26:02,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:02,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:26:02,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:26:02,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:26:02,612 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:26:02,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:26:02,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:26:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:02,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:02,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-20 11:26:02,985 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-20 11:26:03,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:03,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-20 11:26:03,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:03,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-20 11:26:03,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 535 treesize of output 503 [2022-11-20 11:26:03,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 11:26:03,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:03,441 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 285 treesize of output 275 [2022-11-20 11:26:03,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2022-11-20 11:26:04,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:04,527 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 412 treesize of output 394 [2022-11-20 11:26:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:26:05,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607445502] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:05,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:05,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-11-20 11:26:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935839557] [2022-11-20 11:26:05,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:05,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 11:26:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 11:26:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=580, Unknown=24, NotChecked=102, Total=812 [2022-11-20 11:26:05,415 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:06,164 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-11-20 11:26:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:26:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:26:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:06,165 INFO L225 Difference]: With dead ends: 76 [2022-11-20 11:26:06,165 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 11:26:06,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1270, Unknown=29, NotChecked=154, Total=1722 [2022-11-20 11:26:06,167 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:06,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 241 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 284 Unchecked, 0.2s Time] [2022-11-20 11:26:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 11:26:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2022-11-20 11:26:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-20 11:26:06,174 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-11-20 11:26:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:06,174 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-20 11:26:06,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-20 11:26:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:26:06,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:06,176 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:06,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:06,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:06,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 1 times [2022-11-20 11:26:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:06,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868864556] [2022-11-20 11:26:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:06,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868864556] [2022-11-20 11:26:06,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868864556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:06,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815286373] [2022-11-20 11:26:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:06,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:06,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:06,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:26:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:07,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 11:26:07,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:07,021 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-20 11:26:07,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:07,083 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:26:07,084 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-20 11:26:07,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:07,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:26:07,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:26:07,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:26:07,234 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:26:07,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:26:07,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:07,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-11-20 11:26:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:07,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:07,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-20 11:26:07,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-20 11:26:07,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:07,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-20 11:26:07,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:07,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 301 [2022-11-20 11:26:07,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 254 [2022-11-20 11:26:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 11:26:07,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:07,694 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 44 treesize of output 44 [2022-11-20 11:26:07,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-11-20 11:26:07,722 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-20 11:26:07,746 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2022-11-20 11:26:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:26:07,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815286373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:07,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:07,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-11-20 11:26:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048268341] [2022-11-20 11:26:07,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 11:26:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 11:26:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=382, Unknown=12, NotChecked=82, Total=552 [2022-11-20 11:26:07,861 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:08,311 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-11-20 11:26:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:26:08,312 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:26:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:08,313 INFO L225 Difference]: With dead ends: 64 [2022-11-20 11:26:08,313 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 11:26:08,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=811, Unknown=15, NotChecked=122, Total=1122 [2022-11-20 11:26:08,314 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:08,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-11-20 11:26:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 11:26:08,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-11-20 11:26:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-20 11:26:08,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 26 [2022-11-20 11:26:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:08,323 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-20 11:26:08,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-20 11:26:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:26:08,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:08,324 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:08,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:08,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 3 times [2022-11-20 11:26:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756861135] [2022-11-20 11:26:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:09,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756861135] [2022-11-20 11:26:09,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756861135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:09,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009028763] [2022-11-20 11:26:09,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:26:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:09,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:09,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:26:09,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:26:09,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:26:09,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 11:26:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:09,394 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-20 11:26:09,447 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:26:09,448 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-20 11:26:09,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:09,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:09,560 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:26:09,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 11:26:09,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:09,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:09,593 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:26:09,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 11:26:09,709 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:26:09,709 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-20 11:26:09,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:09,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-20 11:26:09,722 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-20 11:26:09,828 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:26:09,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-11-20 11:26:09,847 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:26:09,848 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 11:26:09,879 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:26:09,880 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 2 case distinctions, treesize of input 36 treesize of output 47 [2022-11-20 11:26:09,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 11:26:09,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-11-20 11:26:10,331 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 109 treesize of output 85 [2022-11-20 11:26:10,355 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-20 11:26:10,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 77 [2022-11-20 11:26:10,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:26:10,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-11-20 11:26:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:26:10,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:11,261 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-20 11:26:11,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4279 treesize of output 4035 [2022-11-20 11:26:11,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:11,356 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2154 treesize of output 1887 [2022-11-20 11:26:13,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 11:26:14,250 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse40)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse39 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse0 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse3 (or .cse4 (and .cse3 .cse5)) .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse6)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse7 .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse8 0) (= .cse8 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse12)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse13 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse14)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse15 0) (= .cse15 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse17 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse18)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (let ((.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse36)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse19 0) (= .cse19 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse22)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse23 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse24)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse25 0) (= .cse25 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse27 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse28 0)))))) (or .cse4 (and .cse21 .cse27)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse30 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse32)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse33 .cse1)))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse35)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse38 0))))))))) is different from false [2022-11-20 11:26:15,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:15,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-20 11:26:15,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:15,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-20 11:26:15,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:15,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 250 [2022-11-20 11:26:15,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:15,525 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 243 treesize of output 231 [2022-11-20 11:26:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 187 [2022-11-20 11:26:15,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:15,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2022-11-20 11:26:15,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-20 11:26:15,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-20 11:26:16,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-11-20 11:26:16,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-20 11:26:16,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 130 [2022-11-20 11:26:16,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2022-11-20 11:26:16,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 250 [2022-11-20 11:26:16,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 203 [2022-11-20 11:26:16,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:26:16,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 61 treesize of output 49 [2022-11-20 11:26:16,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2022-11-20 11:26:16,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-11-20 11:26:16,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-20 11:26:16,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:26:16,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,484 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 1 case distinctions, treesize of input 65 treesize of output 58 [2022-11-20 11:26:16,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:26:16,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,496 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-20 11:26:16,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 11:26:16,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,540 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 33 treesize of output 29 [2022-11-20 11:26:16,560 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-20 11:26:16,572 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-20 11:26:16,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-20 11:26:16,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:26:16,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:16,600 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-20 11:26:16,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-20 11:26:16,650 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:26:16,656 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:26:16,667 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-20 11:26:16,678 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-20 11:26:16,690 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-20 11:26:16,701 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-20 11:26:16,713 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-20 11:26:16,723 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-20 11:26:16,730 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:26:16,740 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-20 11:26:16,752 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-20 11:26:16,762 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:26:16,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-20 11:26:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:26:17,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009028763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:17,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:17,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-11-20 11:26:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034536833] [2022-11-20 11:26:17,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:17,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 11:26:17,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 11:26:17,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=889, Unknown=3, NotChecked=60, Total=1056 [2022-11-20 11:26:17,054 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:18,487 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-11-20 11:26:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:26:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:26:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:18,489 INFO L225 Difference]: With dead ends: 73 [2022-11-20 11:26:18,489 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 11:26:18,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=224, Invalid=1757, Unknown=3, NotChecked=86, Total=2070 [2022-11-20 11:26:18,491 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:18,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 227 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 255 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2022-11-20 11:26:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 11:26:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-11-20 11:26:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-11-20 11:26:18,511 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2022-11-20 11:26:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:18,512 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-11-20 11:26:18,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:26:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-11-20 11:26:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:26:18,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:18,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:18,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:18,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:18,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:26:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:18,714 INFO L85 PathProgramCache]: Analyzing trace with hash 268237098, now seen corresponding path program 1 times [2022-11-20 11:26:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:18,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515331417] [2022-11-20 11:26:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:26:18,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:26:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:26:18,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:26:18,783 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:26:18,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:26:18,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:26:18,790 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:18,794 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:26:18,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:26:18 BoogieIcfgContainer [2022-11-20 11:26:18,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:26:18,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:26:18,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:26:18,843 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:26:18,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:44" (3/4) ... [2022-11-20 11:26:18,845 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:26:18,888 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:26:18,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:26:18,889 INFO L158 Benchmark]: Toolchain (without parser) took 35484.31ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 138.2MB in the beginning and 317.1MB in the end (delta: -178.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:26:18,889 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:26:18,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.33ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 133.1MB in the end (delta: 5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:26:18,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 169.9MB. Free memory was 133.1MB in the beginning and 131.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:26:18,890 INFO L158 Benchmark]: Boogie Preprocessor took 29.49ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:26:18,890 INFO L158 Benchmark]: RCFGBuilder took 475.08ms. Allocated memory is still 169.9MB. Free memory was 129.6MB in the beginning and 115.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 11:26:18,891 INFO L158 Benchmark]: TraceAbstraction took 34426.01ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 115.0MB in the beginning and 320.2MB in the end (delta: -205.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:26:18,891 INFO L158 Benchmark]: Witness Printer took 46.24ms. Allocated memory is still 358.6MB. Free memory was 320.2MB in the beginning and 317.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:26:18,892 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.33ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 133.1MB in the end (delta: 5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 169.9MB. Free memory was 133.1MB in the beginning and 131.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.49ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.08ms. Allocated memory is still 169.9MB. Free memory was 129.6MB in the beginning and 115.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34426.01ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 115.0MB in the beginning and 320.2MB in the end (delta: -205.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 46.24ms. Allocated memory is still 358.6MB. Free memory was 320.2MB in the beginning and 317.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [a={-1:0}, p={-1:0}, t={-3:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L556] COND TRUE p->h != 3 [L557] reach_error() VAL [a={-1:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 1753 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1227 IncrementalHoareTripleChecker+Unchecked, 1497 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1752 IncrementalHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 256 mSDtfsCounter, 1752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 366 SyntacticMatches, 20 SemanticMatches, 291 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=14, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 157 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 732 ConstructedInterpolants, 124 QuantifiedInterpolants, 14935 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1436 ConjunctsInSsa, 436 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 28/190 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 11:26:18,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea5c2c3a-7f38-4567-9e07-49209ff827d7/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE