./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- 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-8393723 [2022-11-18 19:36:34,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:36:34,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:36:34,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:36:34,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:36:34,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:36:34,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:36:34,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:36:34,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:36:34,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:36:34,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:36:34,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:36:34,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:36:34,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:36:34,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:36:34,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:36:34,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:36:34,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:36:34,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:36:34,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:36:34,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:36:34,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:36:34,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:36:34,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:36:34,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:36:34,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:36:34,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:36:34,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:36:34,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:36:34,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:36:34,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:36:34,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:36:34,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:36:34,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:36:34,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:36:34,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:36:34,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:36:34,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:36:34,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:36:34,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:36:34,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:36:34,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:36:34,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:36:34,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:36:34,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:36:34,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:36:34,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:36:34,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:36:34,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:36:34,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:36:34,177 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:36:34,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:36:34,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:36:34,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:36:34,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:36:34,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:36:34,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:36:34,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:36:34,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:36:34,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:36:34,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:36:34,181 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:36:34,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:36:34,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:36:34,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:36:34,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:36:34,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:36:34,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:36:34,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:36:34,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:36:34,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:36:34,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:36:34,185 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:36:34,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:36:34,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:36:34,187 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_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/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_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-18 19:36:34,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:36:34,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:36:34,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:36:34,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:36:34,547 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:36:34,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-18 19:36:34,633 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/data/1bbd0d867/cc36031d10e64bda91f4175f023a030f/FLAGda40404f1 [2022-11-18 19:36:35,171 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:36:35,172 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-18 19:36:35,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/data/1bbd0d867/cc36031d10e64bda91f4175f023a030f/FLAGda40404f1 [2022-11-18 19:36:35,474 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/data/1bbd0d867/cc36031d10e64bda91f4175f023a030f [2022-11-18 19:36:35,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:36:35,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:36:35,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:36:35,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:36:35,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:36:35,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:36:35" (1/1) ... [2022-11-18 19:36:35,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4a572d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:35, skipping insertion in model container [2022-11-18 19:36:35,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:36:35" (1/1) ... [2022-11-18 19:36:35,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:36:35,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:36:35,891 WARN L234 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_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-18 19:36:35,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:36:35,916 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:36:36,001 WARN L234 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_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-18 19:36:36,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:36:36,037 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:36:36,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36 WrapperNode [2022-11-18 19:36:36,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:36:36,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:36:36,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:36:36,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:36:36,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,110 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-11-18 19:36:36,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:36:36,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:36:36,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:36:36,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:36:36,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,140 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:36:36,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:36:36,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:36:36,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:36:36,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (1/1) ... [2022-11-18 19:36:36,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:36:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:36:36,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:36:36,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:36:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:36:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:36:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-18 19:36:36,257 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-18 19:36:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:36:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:36:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:36:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:36:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:36:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:36:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:36:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:36:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:36:36,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:36:36,434 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:36:36,437 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:36:36,710 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:36:36,724 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:36:36,725 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 19:36:36,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:36:36 BoogieIcfgContainer [2022-11-18 19:36:36,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:36:36,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:36:36,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:36:36,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:36:36,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:36:35" (1/3) ... [2022-11-18 19:36:36,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70583246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:36:36, skipping insertion in model container [2022-11-18 19:36:36,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:36" (2/3) ... [2022-11-18 19:36:36,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70583246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:36:36, skipping insertion in model container [2022-11-18 19:36:36,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:36:36" (3/3) ... [2022-11-18 19:36:36,740 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-18 19:36:36,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:36:36,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:36:36,820 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:36:36,828 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;@b0142c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:36:36,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:36:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:36:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:36:36,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:36,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:36,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-18 19:36:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:36:36,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671009907] [2022-11-18 19:36:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:36:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:36:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:36:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:36:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671009907] [2022-11-18 19:36:37,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671009907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:36:37,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:36:37,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:36:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092564148] [2022-11-18 19:36:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:36:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:36:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:36:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:36:37,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:36:37,421 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 19:36:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:37,525 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-18 19:36:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:36:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-18 19:36:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:37,537 INFO L225 Difference]: With dead ends: 65 [2022-11-18 19:36:37,537 INFO L226 Difference]: Without dead ends: 28 [2022-11-18 19:36:37,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:36:37,543 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:37,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:36:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-18 19:36:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-18 19:36:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:36:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-18 19:36:37,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-18 19:36:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:37,602 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-18 19:36:37,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 19:36:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-18 19:36:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:36:37,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:37,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:37,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:36:37,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-18 19:36:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:36:37,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987073113] [2022-11-18 19:36:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:36:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:36:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:36:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:36:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:37,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987073113] [2022-11-18 19:36:37,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987073113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:36:37,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:36:37,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:36:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046716544] [2022-11-18 19:36:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:36:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:36:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:36:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:36:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:36:37,915 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 19:36:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:37,981 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-18 19:36:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:36:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-18 19:36:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:37,986 INFO L225 Difference]: With dead ends: 52 [2022-11-18 19:36:37,987 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 19:36:37,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:36:37,989 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:37,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:36:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 19:36:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-18 19:36:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:36:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-18 19:36:38,007 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-18 19:36:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:38,008 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-18 19:36:38,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 19:36:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-18 19:36:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 19:36:38,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:38,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:38,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:36:38,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-18 19:36:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:36:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858943354] [2022-11-18 19:36:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:36:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:36:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:36:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:36:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:36:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858943354] [2022-11-18 19:36:38,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858943354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:38,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740798099] [2022-11-18 19:36:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:38,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:36:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:36:38,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:36:39,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:36:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:39,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 19:36:39,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:39,683 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 17 treesize of output 9 [2022-11-18 19:36:39,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:39,835 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 24 treesize of output 24 [2022-11-18 19:36:39,913 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 25 treesize of output 13 [2022-11-18 19:36:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:36:39,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:36:40,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740798099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:40,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:36:40,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-18 19:36:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460057216] [2022-11-18 19:36:40,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:36:40,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:36:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:36:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:36:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=522, Unknown=3, NotChecked=0, Total=600 [2022-11-18 19:36:40,166 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 19:36:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:40,626 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-18 19:36:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:36:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-11-18 19:36:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:40,629 INFO L225 Difference]: With dead ends: 38 [2022-11-18 19:36:40,629 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 19:36:40,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=807, Unknown=3, NotChecked=0, Total=930 [2022-11-18 19:36:40,631 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:40,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-11-18 19:36:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 19:36:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-18 19:36:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:36:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-18 19:36:40,639 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-18 19:36:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:40,639 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-18 19:36:40,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 19:36:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-18 19:36:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 19:36:40,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:40,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:40,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 19:36:40,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-18 19:36:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:36:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726950972] [2022-11-18 19:36:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:36:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:36:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:36:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:36:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:36:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:42,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726950972] [2022-11-18 19:36:42,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726950972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:42,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950060271] [2022-11-18 19:36:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:36:42,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:36:42,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:36:42,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:36:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:42,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-18 19:36:42,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:42,846 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-18 19:36:42,908 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 5 treesize of output 3 [2022-11-18 19:36:43,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:43,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-18 19:36:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:43,240 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 11 treesize of output 7 [2022-11-18 19:36:43,315 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-18 19:36:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:43,444 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 19:36:43,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:36:43,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 19:36:43,774 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 14 treesize of output 16 [2022-11-18 19:36:44,115 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 37 treesize of output 21 [2022-11-18 19:36:44,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-18 19:36:44,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-18 19:36:44,152 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 7 treesize of output 3 [2022-11-18 19:36:44,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,400 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-18 19:36:44,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,433 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 43 treesize of output 39 [2022-11-18 19:36:44,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,465 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-18 19:36:44,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 19:36:44,482 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 18 treesize of output 20 [2022-11-18 19:36:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,917 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-18 19:36:44,919 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 2 case distinctions, treesize of input 80 treesize of output 75 [2022-11-18 19:36:44,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-18 19:36:44,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:44,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-18 19:36:44,972 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 18 treesize of output 20 [2022-11-18 19:36:45,063 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 27 treesize of output 15 [2022-11-18 19:36:45,069 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 15 treesize of output 7 [2022-11-18 19:36:45,135 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-18 19:36:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:36:45,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:36:46,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_521 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_519))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_521)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_520))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_506))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_508) (select (select (store (store .cse3 .cse1 v_ArrVal_511) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse1 v_ArrVal_510) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-18 19:36:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950060271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:46,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:36:46,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-11-18 19:36:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735105601] [2022-11-18 19:36:46,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:36:46,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 19:36:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:36:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 19:36:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1849, Unknown=86, NotChecked=88, Total=2162 [2022-11-18 19:36:46,573 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:36:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:55,199 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-18 19:36:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:36:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-11-18 19:36:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:55,201 INFO L225 Difference]: With dead ends: 57 [2022-11-18 19:36:55,201 INFO L226 Difference]: Without dead ends: 48 [2022-11-18 19:36:55,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=236, Invalid=2981, Unknown=93, NotChecked=112, Total=3422 [2022-11-18 19:36:55,204 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:55,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 361 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 0 Unknown, 97 Unchecked, 0.5s Time] [2022-11-18 19:36:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-18 19:36:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-11-18 19:36:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 19:36:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-18 19:36:55,215 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-11-18 19:36:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:55,216 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-18 19:36:55,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:36:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-18 19:36:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 19:36:55,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:55,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:55,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:55,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:36:55,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-18 19:36:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:36:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690781360] [2022-11-18 19:36:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:36:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:36:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:36:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:36:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:36:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:58,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690781360] [2022-11-18 19:36:58,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690781360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:58,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074225435] [2022-11-18 19:36:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:36:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:36:58,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:36:58,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:36:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:58,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 163 conjunts are in the unsatisfiable core [2022-11-18 19:36:58,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:58,695 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-18 19:36:58,800 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 5 treesize of output 3 [2022-11-18 19:36:59,022 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:36:59,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:36:59,302 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 11 treesize of output 7 [2022-11-18 19:36:59,401 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-18 19:36:59,565 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 19:36:59,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:36:59,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 19:36:59,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-18 19:36:59,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 19:36:59,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:36:59,975 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 1 case distinctions, treesize of input 56 treesize of output 51 [2022-11-18 19:36:59,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 19:37:00,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 19:37:00,379 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:37:00,380 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2022-11-18 19:37:00,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:37:00,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-18 19:37:00,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:00,775 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:37:00,775 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2022-11-18 19:37:00,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:00,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:00,807 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 19:37:00,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-18 19:37:00,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:00,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:00,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-18 19:37:00,838 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 18 treesize of output 20 [2022-11-18 19:37:01,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:01,780 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-18 19:37:01,781 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 151 [2022-11-18 19:37:01,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:01,844 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-11-18 19:37:01,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 96 [2022-11-18 19:37:01,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-18 19:37:01,873 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 18 treesize of output 20 [2022-11-18 19:37:01,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:01,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:01,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-11-18 19:37:02,031 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:37:02,032 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-18 19:37:02,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2022-11-18 19:37:02,149 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-18 19:37:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:37:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:04,371 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_720 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_720)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-11-18 19:37:04,387 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_720 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_720)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_723) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-11-18 19:37:04,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_737)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_735))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse3 .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_736))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_720))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_723) (select (select (store (store .cse3 .cse1 v_ArrVal_717) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)))) is different from false [2022-11-18 19:37:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074225435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:04,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-11-18 19:37:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851312512] [2022-11-18 19:37:04,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-18 19:37:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-18 19:37:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2120, Unknown=89, NotChecked=288, Total=2652 [2022-11-18 19:37:04,561 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:06,601 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-18 19:37:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:37:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-11-18 19:37:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:06,604 INFO L225 Difference]: With dead ends: 63 [2022-11-18 19:37:06,604 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 19:37:06,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=261, Invalid=2962, Unknown=95, NotChecked=342, Total=3660 [2022-11-18 19:37:06,606 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:06,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 295 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 658 Invalid, 0 Unknown, 39 Unchecked, 0.7s Time] [2022-11-18 19:37:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 19:37:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-11-18 19:37:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 19:37:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-18 19:37:06,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 37 [2022-11-18 19:37:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:06,620 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-18 19:37:06,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-18 19:37:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:37:06,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:06,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:06,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:06,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:06,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-18 19:37:06,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:06,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806676237] [2022-11-18 19:37:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:37:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:37:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:08,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806676237] [2022-11-18 19:37:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806676237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209031371] [2022-11-18 19:37:08,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:37:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:08,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:08,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:37:08,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:37:08,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:37:08,830 WARN L261 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 204 conjunts are in the unsatisfiable core [2022-11-18 19:37:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:08,890 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-18 19:37:08,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:08,935 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 16 treesize of output 17 [2022-11-18 19:37:09,289 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-18 19:37:09,426 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:37:09,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:37:09,442 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-18 19:37:09,566 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-18 19:37:09,587 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 19 treesize of output 18 [2022-11-18 19:37:09,610 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 19 treesize of output 18 [2022-11-18 19:37:09,780 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:37:09,780 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 77 treesize of output 51 [2022-11-18 19:37:09,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-18 19:37:09,812 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 18 treesize of output 20 [2022-11-18 19:37:10,115 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-18 19:37:10,115 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 48 [2022-11-18 19:37:10,127 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 7 treesize of output 3 [2022-11-18 19:37:10,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:10,142 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:37:10,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 19:37:10,149 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 11 treesize of output 7 [2022-11-18 19:37:10,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:10,440 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 19:37:10,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 94 [2022-11-18 19:37:10,475 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:37:10,476 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 18 treesize of output 28 [2022-11-18 19:37:10,485 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 5 treesize of output 3 [2022-11-18 19:37:10,517 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 19:37:10,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:37:10,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:10,540 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 19:37:10,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-18 19:37:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:37:11,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:11,726 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_949) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_942) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-18 19:37:14,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209031371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:14,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:14,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2022-11-18 19:37:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420627313] [2022-11-18 19:37:14,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:14,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 19:37:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 19:37:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2362, Unknown=2, NotChecked=98, Total=2652 [2022-11-18 19:37:14,124 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:15,098 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-18 19:37:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:37:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2022-11-18 19:37:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:15,101 INFO L225 Difference]: With dead ends: 69 [2022-11-18 19:37:15,101 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 19:37:15,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=232, Invalid=2740, Unknown=2, NotChecked=106, Total=3080 [2022-11-18 19:37:15,103 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:15,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 223 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 443 Invalid, 0 Unknown, 35 Unchecked, 0.5s Time] [2022-11-18 19:37:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 19:37:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-18 19:37:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 19:37:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-11-18 19:37:15,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 39 [2022-11-18 19:37:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:15,117 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-11-18 19:37:15,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-11-18 19:37:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 19:37:15,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:15,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:15,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:15,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 19:37:15,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-18 19:37:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:15,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555253658] [2022-11-18 19:37:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:37:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:37:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:17,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555253658] [2022-11-18 19:37:17,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555253658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545967373] [2022-11-18 19:37:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:17,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:17,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:18,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:37:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:18,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-18 19:37:18,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:18,241 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-18 19:37:18,253 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 5 treesize of output 3 [2022-11-18 19:37:18,424 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:37:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:37:18,629 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 11 treesize of output 7 [2022-11-18 19:37:18,698 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 19:37:18,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:37:18,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-18 19:37:18,978 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:37:18,978 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 19:37:19,220 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 19:37:19,220 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2022-11-18 19:37:19,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-18 19:37:19,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:19,499 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:37:19,499 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2022-11-18 19:37:19,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:19,508 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 60 treesize of output 58 [2022-11-18 19:37:19,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:19,538 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-18 19:37:19,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-11-18 19:37:20,142 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-18 19:37:20,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2022-11-18 19:37:20,182 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-18 19:37:20,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2022-11-18 19:37:20,212 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-18 19:37:20,212 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 147 [2022-11-18 19:37:20,354 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 121 treesize of output 93 [2022-11-18 19:37:20,647 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-18 19:37:20,647 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2022-11-18 19:37:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:37:20,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:20,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-18 19:37:20,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-18 19:37:20,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-18 19:37:21,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1159)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1158))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store .cse2 .cse3 v_ArrVal_1146) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-18 19:37:21,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545967373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:21,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:21,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2022-11-18 19:37:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577383249] [2022-11-18 19:37:21,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:21,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-18 19:37:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-18 19:37:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2087, Unknown=46, NotChecked=380, Total=2652 [2022-11-18 19:37:21,396 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:37:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:24,326 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-18 19:37:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 19:37:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-11-18 19:37:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:24,328 INFO L225 Difference]: With dead ends: 82 [2022-11-18 19:37:24,329 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 19:37:24,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=305, Invalid=4209, Unknown=58, NotChecked=540, Total=5112 [2022-11-18 19:37:24,331 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:24,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 407 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 744 Invalid, 0 Unknown, 102 Unchecked, 0.8s Time] [2022-11-18 19:37:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 19:37:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2022-11-18 19:37:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:37:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-11-18 19:37:24,351 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 40 [2022-11-18 19:37:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:24,352 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-11-18 19:37:24,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:37:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-11-18 19:37:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 19:37:24,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:24,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:24,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 19:37:24,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:24,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-11-18 19:37:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:24,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133683530] [2022-11-18 19:37:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:37:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:37:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:28,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133683530] [2022-11-18 19:37:28,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133683530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:28,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898438414] [2022-11-18 19:37:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:28,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:28,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:37:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:28,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 172 conjunts are in the unsatisfiable core [2022-11-18 19:37:28,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:28,742 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-18 19:37:28,815 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 5 treesize of output 3 [2022-11-18 19:37:28,966 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-18 19:37:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:29,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-18 19:37:29,354 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 7 treesize of output 3 [2022-11-18 19:37:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:29,360 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 11 treesize of output 7 [2022-11-18 19:37:29,653 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:37:29,653 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 14 treesize of output 20 [2022-11-18 19:37:29,664 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 5 treesize of output 3 [2022-11-18 19:37:29,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:29,713 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 19:37:29,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:37:29,870 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 14 treesize of output 16 [2022-11-18 19:37:29,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 19:37:29,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 19:37:30,104 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:37:30,105 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 1 case distinctions, treesize of input 75 treesize of output 66 [2022-11-18 19:37:30,129 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 18 treesize of output 20 [2022-11-18 19:37:30,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,139 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 31 treesize of output 26 [2022-11-18 19:37:30,447 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:37:30,447 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 39 [2022-11-18 19:37:30,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-18 19:37:30,469 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 7 treesize of output 3 [2022-11-18 19:37:30,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:37:30,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,833 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:37:30,834 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 68 [2022-11-18 19:37:30,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,857 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:37:30,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-18 19:37:30,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:30,908 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 19:37:30,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-18 19:37:30,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 19:37:31,828 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-18 19:37:31,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 107 [2022-11-18 19:37:31,882 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-18 19:37:31,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 145 [2022-11-18 19:37:31,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,900 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-11-18 19:37:31,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,916 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:37:31,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2022-11-18 19:37:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:31,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2022-11-18 19:37:31,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-18 19:37:32,496 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-11-18 19:37:32,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 78 [2022-11-18 19:37:32,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:32,695 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 19:37:32,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 22 [2022-11-18 19:37:32,798 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-18 19:37:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:37:32,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:33,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-18 19:37:34,465 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3))))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) is different from false [2022-11-18 19:37:36,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)))))) is different from false [2022-11-18 19:37:36,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1358)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1361))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1356) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))))))) is different from false [2022-11-18 19:37:37,182 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1375)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1376))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select .cse0 .cse1) .cse2))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select .cse9 .cse1) .cse2))) (let ((.cse8 (store (store .cse0 .cse4 (store (select .cse0 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1358)) (.cse5 (store (store .cse9 .cse4 (store (select .cse9 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1361))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1374))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1356) (select (select .cse5 .cse6) .cse7)) (+ 4 (select (select .cse8 .cse6) .cse7))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|) 0)))))) is different from false [2022-11-18 19:37:37,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898438414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:37,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:37,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-11-18 19:37:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162222471] [2022-11-18 19:37:37,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:37,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 19:37:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 19:37:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2605, Unknown=7, NotChecked=530, Total=3306 [2022-11-18 19:37:37,189 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:39,828 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-11-18 19:37:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:37:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-11-18 19:37:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:39,829 INFO L225 Difference]: With dead ends: 74 [2022-11-18 19:37:39,829 INFO L226 Difference]: Without dead ends: 72 [2022-11-18 19:37:39,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=248, Invalid=3671, Unknown=7, NotChecked=630, Total=4556 [2022-11-18 19:37:39,831 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:39,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 689 Invalid, 0 Unknown, 61 Unchecked, 0.9s Time] [2022-11-18 19:37:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-18 19:37:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-18 19:37:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:37:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2022-11-18 19:37:39,864 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 41 [2022-11-18 19:37:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:39,865 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2022-11-18 19:37:39,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-11-18 19:37:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 19:37:39,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:39,867 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:39,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:40,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1003701405, now seen corresponding path program 2 times [2022-11-18 19:37:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:40,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174645922] [2022-11-18 19:37:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 19:37:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 19:37:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 19:37:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174645922] [2022-11-18 19:37:40,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174645922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:40,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633688202] [2022-11-18 19:37:40,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:37:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:40,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:40,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:37:40,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:37:40,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:37:40,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:37:40,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:37:40,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:37:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633688202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:40,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:37:40,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 19:37:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952904474] [2022-11-18 19:37:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:40,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:40,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:40,512 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:37:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:40,534 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-11-18 19:37:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-18 19:37:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:40,536 INFO L225 Difference]: With dead ends: 84 [2022-11-18 19:37:40,536 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 19:37:40,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:40,537 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:40,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:37:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 19:37:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-18 19:37:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:37:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-11-18 19:37:40,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 43 [2022-11-18 19:37:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:40,550 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-11-18 19:37:40,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:37:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-11-18 19:37:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 19:37:40,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:40,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:40,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:40,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:40,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2022-11-18 19:37:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312135471] [2022-11-18 19:37:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:37:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:37:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312135471] [2022-11-18 19:37:43,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312135471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263008182] [2022-11-18 19:37:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:43,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:43,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:37:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:43,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-18 19:37:43,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:43,955 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-18 19:37:44,203 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 5 treesize of output 3 [2022-11-18 19:37:44,451 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:37:44,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:37:44,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 19:37:44,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-18 19:37:44,784 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:37:44,784 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 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-18 19:37:44,799 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 25 treesize of output 25 [2022-11-18 19:37:45,116 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:37:45,116 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 45 [2022-11-18 19:37:45,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 19:37:45,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:37:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:45,480 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 19:37:45,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 71 [2022-11-18 19:37:45,515 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 19:37:45,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:37:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:45,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:45,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-18 19:37:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:46,868 INFO L321 Elim1Store]: treesize reduction 195, result has 14.5 percent of original size [2022-11-18 19:37:46,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 210 treesize of output 122 [2022-11-18 19:37:46,919 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-18 19:37:46,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 328 treesize of output 207 [2022-11-18 19:37:46,967 INFO L321 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2022-11-18 19:37:46,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 163 [2022-11-18 19:37:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:47,011 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-18 19:37:47,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 139 [2022-11-18 19:37:47,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:47,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:47,656 INFO L321 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2022-11-18 19:37:47,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 97 [2022-11-18 19:37:48,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:37:48,053 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 19:37:48,054 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 43 [2022-11-18 19:37:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:37:48,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:48,180 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1791))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1789))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-18 19:37:50,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263008182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:50,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:50,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2022-11-18 19:37:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698690472] [2022-11-18 19:37:50,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:50,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 19:37:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 19:37:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3021, Unknown=2, NotChecked=110, Total=3306 [2022-11-18 19:37:50,287 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:53,272 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-18 19:37:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 19:37:53,273 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-11-18 19:37:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:53,274 INFO L225 Difference]: With dead ends: 42 [2022-11-18 19:37:53,274 INFO L226 Difference]: Without dead ends: 39 [2022-11-18 19:37:53,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=318, Invalid=4514, Unknown=2, NotChecked=136, Total=4970 [2022-11-18 19:37:53,277 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:53,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 267 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 783 Invalid, 0 Unknown, 8 Unchecked, 0.9s Time] [2022-11-18 19:37:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-18 19:37:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-18 19:37:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:37:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-18 19:37:53,287 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 44 [2022-11-18 19:37:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:53,287 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-18 19:37:53,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:37:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-18 19:37:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 19:37:53,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:53,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:53,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:53,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 19:37:53,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2022-11-18 19:37:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:53,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649882745] [2022-11-18 19:37:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:37:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:37:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:37:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:37:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649882745] [2022-11-18 19:37:57,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649882745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222962133] [2022-11-18 19:37:57,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:37:57,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:37:57,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:57,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:37:57,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6d1b65-68cb-4c3e-885c-7ea7356fc3b4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:37:58,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:37:58,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:37:58,086 WARN L261 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 228 conjunts are in the unsatisfiable core [2022-11-18 19:37:58,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:58,198 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-18 19:37:58,302 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-18 19:37:58,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:58,311 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 16 treesize of output 17 [2022-11-18 19:37:58,723 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 7 treesize of output 3 [2022-11-18 19:37:58,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 5 treesize of output 3 [2022-11-18 19:37:58,732 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 7 treesize of output 3 [2022-11-18 19:37:59,165 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:37:59,165 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 14 treesize of output 20 [2022-11-18 19:37:59,222 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:37:59,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:37:59,252 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-18 19:37:59,481 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-18 19:37:59,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 19 treesize of output 18 [2022-11-18 19:37:59,522 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-18 19:37:59,762 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:37:59,763 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 104 treesize of output 66 [2022-11-18 19:37:59,778 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 31 treesize of output 26 [2022-11-18 19:37:59,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-18 19:38:00,222 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-18 19:38:00,223 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 51 [2022-11-18 19:38:00,234 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 11 treesize of output 7 [2022-11-18 19:38:00,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 19:38:00,251 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 7 treesize of output 3 [2022-11-18 19:38:00,502 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 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-18 19:38:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,746 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 19:38:00,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 101 [2022-11-18 19:38:00,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:00,803 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-18 19:38:00,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2022-11-18 19:38:00,875 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 19:38:00,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:38:00,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 19:38:02,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:02,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,121 INFO L321 Elim1Store]: treesize reduction 526, result has 29.4 percent of original size [2022-11-18 19:38:04,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 29 case distinctions, treesize of input 513 treesize of output 408 [2022-11-18 19:38:04,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:04,579 INFO L321 Elim1Store]: treesize reduction 284, result has 32.2 percent of original size [2022-11-18 19:38:04,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 253 treesize of output 332 [2022-11-18 19:38:04,733 INFO L321 Elim1Store]: treesize reduction 63, result has 36.4 percent of original size [2022-11-18 19:38:04,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 133 [2022-11-18 19:38:04,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 26 [2022-11-18 19:38:04,906 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 5 treesize of output 3 [2022-11-18 19:38:04,964 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 20 treesize of output 19 [2022-11-18 19:38:05,365 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-18 19:38:05,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 36 [2022-11-18 19:38:05,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:05,873 INFO L321 Elim1Store]: treesize reduction 84, result has 52.5 percent of original size [2022-11-18 19:38:05,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 149 treesize of output 178 [2022-11-18 19:38:06,241 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:38:06,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 91 [2022-11-18 19:38:06,356 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:38:06,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 80 [2022-11-18 19:39:06,572 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:07,005 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:08,307 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:09,453 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:09,823 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:11,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:12,463 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:39:13,283 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:01,543 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:01,899 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:03,222 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:04,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:04,467 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:05,952 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:07,100 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:07,863 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:25,626 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:27,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:27,882 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:29,009 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:29,537 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:30,148 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:31,490 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:32,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:32,915 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:33,951 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:35,179 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:35,685 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:40:36,499 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:41:00,198 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:41:00,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:43:29,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,660 INFO L217 Elim1Store]: Index analysis took 564 ms