./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 5e519f3a 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:56:34,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:34,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:34,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:34,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:34,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:34,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:34,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:34,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:34,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:34,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:34,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:34,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:34,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:34,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:34,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:34,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:34,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:34,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:34,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:34,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:34,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:34,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:34,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:34,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:34,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:34,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:34,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:34,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:34,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:34,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:34,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:34,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:34,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:34,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:34,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:34,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:34,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:34,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:34,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:34,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:34,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:56:34,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:34,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:34,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:34,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:34,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:34,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:34,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:34,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:34,755 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:34,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:34,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:56:34,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:34,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:56:34,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:34,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:56:34,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:34,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:56:34,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:56:34,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:56:34,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:34,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:56:34,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:34,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:34,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:34,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:34,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:34,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:34,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:56:34,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:34,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:34,761 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:56:34,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:56:34,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:56:34,762 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/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_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc 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-02 20:56:35,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:35,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:35,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:35,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:35,190 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:35,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-02 20:56:35,282 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/40854fa6d/621c875b96ea41f596ee272a7c589e80/FLAGf6d4bbcd8 [2022-11-02 20:56:35,972 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:35,973 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-02 20:56:36,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/40854fa6d/621c875b96ea41f596ee272a7c589e80/FLAGf6d4bbcd8 [2022-11-02 20:56:36,220 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/40854fa6d/621c875b96ea41f596ee272a7c589e80 [2022-11-02 20:56:36,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:36,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:36,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:36,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:36,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:36,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:36,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e95aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36, skipping insertion in model container [2022-11-02 20:56:36,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:36,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:36,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:36,846 WARN L230 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-02 20:56:36,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:36,869 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:36,935 WARN L230 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-02 20:56:36,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:36,973 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:36,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36 WrapperNode [2022-11-02 20:56:36,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:36,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:36,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:36,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:36,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,073 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-11-02 20:56:37,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:37,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:37,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:37,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:37,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:37,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:37,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:37,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:37,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (1/1) ... [2022-11-02 20:56:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:37,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:37,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:56:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:56:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:56:37,253 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:56:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:56:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:56:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:56:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:56:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:56:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:37,505 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:37,508 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:37,799 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:37,807 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:37,807 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:56:37,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:37 BoogieIcfgContainer [2022-11-02 20:56:37,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:37,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:37,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:37,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:37,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:36" (1/3) ... [2022-11-02 20:56:37,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63598368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:37, skipping insertion in model container [2022-11-02 20:56:37,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:36" (2/3) ... [2022-11-02 20:56:37,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63598368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:37, skipping insertion in model container [2022-11-02 20:56:37,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:37" (3/3) ... [2022-11-02 20:56:37,835 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-02 20:56:37,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:37,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:56:37,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:56:37,951 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;@7de2d6c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:56:37,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:56:37,961 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-02 20:56:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:56:37,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:37,975 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-02 20:56:37,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-02 20:56:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:38,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536038278] [2022-11-02 20:56:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:38,535 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-02 20:56:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:38,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536038278] [2022-11-02 20:56:38,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536038278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:38,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:38,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146864055] [2022-11-02 20:56:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:38,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:38,609 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-02 20:56:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:38,759 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-02 20:56:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:38,763 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-02 20:56:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:38,772 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:56:38,772 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:56:38,776 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-02 20:56:38,780 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-02 20:56:38,781 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-02 20:56:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:56:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 20:56:38,826 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-02 20:56:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-02 20:56:38,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-02 20:56:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:38,831 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-02 20:56:38,832 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-02 20:56:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-02 20:56:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:56:38,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:38,834 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-02 20:56:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:56:38,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-02 20:56:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:38,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670037635] [2022-11-02 20:56:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:39,151 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-02 20:56:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:39,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670037635] [2022-11-02 20:56:39,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670037635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:39,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:39,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493933199] [2022-11-02 20:56:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:39,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:56:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:56:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:56:39,156 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-02 20:56:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:39,279 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-02 20:56:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:56:39,282 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-02 20:56:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:39,289 INFO L225 Difference]: With dead ends: 52 [2022-11-02 20:56:39,289 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:56:39,293 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-02 20:56:39,296 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02 20:56:39,297 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-02 20:56:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:56:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-02 20:56:39,310 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-02 20:56:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-02 20:56:39,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-02 20:56:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:39,318 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-02 20:56:39,319 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-02 20:56:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-02 20:56:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:56:39,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:39,323 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-02 20:56:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:56:39,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-02 20:56:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:39,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813495471] [2022-11-02 20:56:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:56:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:56:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,466 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-02 20:56:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:40,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813495471] [2022-11-02 20:56:40,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813495471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:40,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816567818] [2022-11-02 20:56:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:40,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:40,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:56:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:56:40,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:41,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:41,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:41,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:41,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:41,500 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-02 20:56:41,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:41,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| v_ArrVal_316) |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_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2022-11-02 20:56:41,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816567818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:41,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:41,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-02 20:56:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668908173] [2022-11-02 20:56:41,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:56:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:56:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-11-02 20:56:41,707 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-02 20:56:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:42,230 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-02 20:56:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:56:42,231 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-02 20:56:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:42,234 INFO L225 Difference]: With dead ends: 38 [2022-11-02 20:56:42,234 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:56:42,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2022-11-02 20:56:42,236 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:42,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 187 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-11-02 20:56:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:56:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-02 20:56:42,244 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-02 20:56:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-02 20:56:42,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-02 20:56:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:42,246 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-02 20:56:42,247 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-02 20:56:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-02 20:56:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:56:42,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:42,249 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-02 20:56:42,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:56:42,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:42,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-02 20:56:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330613264] [2022-11-02 20:56:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:56:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:56:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:44,218 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-02 20:56:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330613264] [2022-11-02 20:56:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330613264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713865852] [2022-11-02 20:56:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:44,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:44,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:56:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:44,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-02 20:56:44,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:44,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:44,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:45,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:45,412 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:56:45,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,521 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:56:46,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:47,017 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-02 20:56:47,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 71 [2022-11-02 20:56:47,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:47,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2022-11-02 20:56:47,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:47,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:47,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:47,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:47,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:47,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:47,290 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-02 20:56:47,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:47,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (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| (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_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |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| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 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-02 20:56:47,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (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| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#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_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-11-02 20:56:47,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (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|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_505) |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 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| 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-02 20:56:47,706 WARN L833 $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_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| 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))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_521))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (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 (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 ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_520))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_508) (select (select (store (store .cse3 .cse2 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 .cse0 .cse2 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-02 20:56:47,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713865852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:47,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:47,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-11-02 20:56:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894314996] [2022-11-02 20:56:47,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:47,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:56:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:56:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1680, Unknown=6, NotChecked=340, Total=2162 [2022-11-02 20:56:47,717 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-02 20:56:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:49,369 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-02 20:56:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:56:49,370 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-02 20:56:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:49,371 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:56:49,372 INFO L226 Difference]: Without dead ends: 48 [2022-11-02 20:56:49,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=227, Invalid=2753, Unknown=6, NotChecked=436, Total=3422 [2022-11-02 20:56:49,374 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:49,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 361 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 492 Invalid, 0 Unknown, 97 Unchecked, 0.6s Time] [2022-11-02 20:56:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-02 20:56:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-11-02 20:56:49,387 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-02 20:56:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-02 20:56:49,389 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-11-02 20:56:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-02 20:56:49,390 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-02 20:56:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-02 20:56:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:56:49,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:49,392 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-02 20:56:49,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:49,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-02 20:56:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:49,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262313358] [2022-11-02 20:56:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:56:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:56:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,612 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-02 20:56:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262313358] [2022-11-02 20:56:52,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262313358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:52,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032618876] [2022-11-02 20:56:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:52,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:52,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:52,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:56:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:53,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-02 20:56:53,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:53,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:53,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:53,507 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:56:53,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:53,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:53,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:53,946 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:56:53,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,324 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:54,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 43 [2022-11-02 20:56:54,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,636 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:54,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 33 [2022-11-02 20:56:54,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:54,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:54,971 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:56:54,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 58 [2022-11-02 20:56:54,995 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:56:54,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:55,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:55,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:55,035 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:56:55,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:55,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:55,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:56:55,831 INFO L356 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2022-11-02 20:56:55,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 140 treesize of output 82 [2022-11-02 20:56:55,883 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:56:55,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 221 treesize of output 132 [2022-11-02 20:56:55,922 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-02 20:56:55,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 195 treesize of output 185 [2022-11-02 20:56:55,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-11-02 20:56:56,125 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-11-02 20:56:56,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 132 treesize of output 42 [2022-11-02 20:56:56,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:56,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:56,290 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-02 20:56:56,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:56,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_718 (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_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (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|) |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_723) |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| v_ArrVal_718) |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|) 4)))) is different from false [2022-11-02 20:56:56,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |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|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |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 v_ArrVal_718) |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|) 4))))) is different from false [2022-11-02 20:56:56,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |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 v_ArrVal_718) |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|) 4))))) is different from false [2022-11-02 20:56:56,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_723) |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 v_ArrVal_718) |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|) 4))))) is different from false [2022-11-02 20:56:56,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_731 (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 ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_731)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |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|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_732) .cse0 v_ArrVal_715) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_714) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_718) |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|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:56:56,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032618876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:56,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:56,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-11-02 20:56:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868200832] [2022-11-02 20:56:56,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:56:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:56:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1937, Unknown=6, NotChecked=460, Total=2550 [2022-11-02 20:56:56,700 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 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-02 20:56:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:58,292 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-02 20:56:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 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-02 20:56:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:58,296 INFO L225 Difference]: With dead ends: 56 [2022-11-02 20:56:58,297 INFO L226 Difference]: Without dead ends: 54 [2022-11-02 20:56:58,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=217, Invalid=2659, Unknown=6, NotChecked=540, Total=3422 [2022-11-02 20:56:58,299 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:58,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 267 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 601 Invalid, 0 Unknown, 34 Unchecked, 0.7s Time] [2022-11-02 20:56:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-02 20:56:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-11-02 20:56:58,315 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-02 20:56:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-02 20:56:58,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 37 [2022-11-02 20:56:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:58,317 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-02 20:56:58,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 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-02 20:56:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-02 20:56:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:56:58,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:58,319 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-02 20:56:58,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:58,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-02 20:56:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459066639] [2022-11-02 20:56:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:57:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:57:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:57:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459066639] [2022-11-02 20:57:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459066639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327803427] [2022-11-02 20:57:00,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:57:00,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:00,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:00,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:57:00,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:57:00,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:57:00,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-02 20:57:00,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:01,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,507 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:01,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,866 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:57:01,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 44 [2022-11-02 20:57:01,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:01,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-11-02 20:57:02,235 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-02 20:57:02,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 49 [2022-11-02 20:57:02,292 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:57:02,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:02,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:02,631 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:57:02,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 87 [2022-11-02 20:57:02,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:02,679 INFO L356 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2022-11-02 20:57:02,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 68 [2022-11-02 20:57:02,722 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:57:02,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:02,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:02,762 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:57:02,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:03,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:03,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_929 (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_930) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_936) (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_939) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_938) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:57:05,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327803427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:05,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:05,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2022-11-02 20:57:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673159490] [2022-11-02 20:57:05,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:57:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:57:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2278, Unknown=4, NotChecked=96, Total=2550 [2022-11-02 20:57:05,519 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 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-02 20:57:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:06,700 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-11-02 20:57:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:57:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 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-02 20:57:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:06,702 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:57:06,702 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 20:57:06,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=239, Invalid=2841, Unknown=4, NotChecked=108, Total=3192 [2022-11-02 20:57:06,705 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:06,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 238 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 418 Invalid, 0 Unknown, 31 Unchecked, 0.5s Time] [2022-11-02 20:57:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 20:57:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-11-02 20:57:06,717 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-02 20:57:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-11-02 20:57:06,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 39 [2022-11-02 20:57:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:06,719 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-11-02 20:57:06,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 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-02 20:57:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-11-02 20:57:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:57:06,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:06,722 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-02 20:57:06,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:06,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-02 20:57:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769980677] [2022-11-02 20:57:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:06,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:57:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:57:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,127 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-02 20:57:09,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:09,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769980677] [2022-11-02 20:57:09,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769980677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:09,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976805083] [2022-11-02 20:57:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:09,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:09,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:57:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-02 20:57:09,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:09,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:09,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:09,671 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:09,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:09,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:09,936 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:57:09,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,206 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:10,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,438 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:57:10,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:10,703 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:10,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:10,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:10,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:10,742 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-02 20:57:10,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,388 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-02 20:57:11,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,428 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:57:11,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,463 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-02 20:57:11,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,914 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 20:57:11,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:11,920 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-02 20:57:11,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:11,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| 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_1139))) (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_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-02 20:57:11,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| 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_1139))) (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_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-02 20:57:11,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| 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 ((.cse1 (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_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:57:12,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| 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 ((.cse1 (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_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:57:12,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1135 (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)) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1147)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1146))) (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 ((.cse1 (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_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_1135) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (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)))) is different from false [2022-11-02 20:57:12,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976805083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:12,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:12,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2022-11-02 20:57:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584830353] [2022-11-02 20:57:12,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:57:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:57:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1683, Unknown=7, NotChecked=430, Total=2256 [2022-11-02 20:57:12,112 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 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-02 20:57:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:13,754 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-11-02 20:57:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:57:13,755 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 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 40 [2022-11-02 20:57:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:13,756 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:57:13,756 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:57:13,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=231, Invalid=2752, Unknown=7, NotChecked=550, Total=3540 [2022-11-02 20:57:13,759 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:13,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 452 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 658 Invalid, 0 Unknown, 165 Unchecked, 0.7s Time] [2022-11-02 20:57:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:57:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-02 20:57:13,788 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-02 20:57:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-11-02 20:57:13,794 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 40 [2022-11-02 20:57:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:13,797 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-11-02 20:57:13,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 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-02 20:57:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-11-02 20:57:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:57:13,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:13,808 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-02 20:57:13,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:14,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-11-02 20:57:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149022355] [2022-11-02 20:57:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:57:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:57:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:18,366 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-02 20:57:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149022355] [2022-11-02 20:57:18,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149022355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468074497] [2022-11-02 20:57:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:18,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:18,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:57:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:18,868 WARN L261 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 201 conjunts are in the unsatisfiable core [2022-11-02 20:57:18,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:18,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,661 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:57:19,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,707 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:19,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:19,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:20,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:20,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 72 [2022-11-02 20:57:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:20,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 30 [2022-11-02 20:57:20,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:57:20,478 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:20,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 48 [2022-11-02 20:57:20,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2022-11-02 20:57:20,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:20,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:20,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:20,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:20,932 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:20,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 77 [2022-11-02 20:57:20,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:20,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:20,958 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:57:20,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 43 [2022-11-02 20:57:21,004 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-02 20:57:21,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-02 20:57:21,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:21,052 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:57:21,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:22,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:22,756 INFO L356 Elim1Store]: treesize reduction 370, result has 11.9 percent of original size [2022-11-02 20:57:22,758 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 20:57:22,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:22,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:57:22,959 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 105 context size 105 output size 105 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-02 20:57:22,963 INFO L158 Benchmark]: Toolchain (without parser) took 46736.78ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 54.0MB in the beginning and 157.1MB in the end (delta: -103.1MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,963 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 96.5MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:57:22,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.69ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 64.3MB in the end (delta: -10.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.87ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,964 INFO L158 Benchmark]: Boogie Preprocessor took 74.46ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 60.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,964 INFO L158 Benchmark]: RCFGBuilder took 660.28ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 43.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,966 INFO L158 Benchmark]: TraceAbstraction took 45150.12ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 43.0MB in the beginning and 157.1MB in the end (delta: -114.1MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. [2022-11-02 20:57:22,968 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 96.5MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.69ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 64.3MB in the end (delta: -10.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.87ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.46ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 60.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.28ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 43.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45150.12ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 43.0MB in the beginning and 157.1MB in the end (delta: -114.1MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 105 context size 105 output size 105 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 105 context size 105 output size 105: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-02 20:57:23,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:57:25,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:25,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:25,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:25,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:25,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:25,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:25,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:25,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:25,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:25,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:25,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:25,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:25,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:25,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:25,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:25,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:25,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:25,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:25,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:25,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:25,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:25,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:25,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:25,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:25,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:25,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:25,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:25,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:25,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:25,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:25,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:25,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:25,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:25,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:25,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:25,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:25,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:25,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:25,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:25,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:25,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:57:25,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:25,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:25,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:25,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:25,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:25,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:25,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:25,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:25,677 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:25,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:25,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:25,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:25,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:25,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:25,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:25,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:25,680 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:57:25,680 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:57:25,680 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:57:25,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:25,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:25,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:25,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:25,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:25,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:25,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:25,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:25,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:25,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:25,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:25,683 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:57:25,684 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:25,684 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:25,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:25,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:25,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:57:25,685 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/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_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc 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-02 20:57:26,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:26,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:26,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:26,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:26,154 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:26,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-02 20:57:26,234 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/d35f28d89/7307e2cae8344176b420ca87b38e18ae/FLAGdc791abf2 [2022-11-02 20:57:27,023 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:27,027 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-02 20:57:27,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/d35f28d89/7307e2cae8344176b420ca87b38e18ae/FLAGdc791abf2 [2022-11-02 20:57:27,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/data/d35f28d89/7307e2cae8344176b420ca87b38e18ae [2022-11-02 20:57:27,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:27,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:27,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:27,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:27,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:27,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf8e842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27, skipping insertion in model container [2022-11-02 20:57:27,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:27,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:27,721 WARN L230 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-02 20:57:27,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:27,739 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:27,786 WARN L230 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_b12352c7-3e0c-4aa8-b537-802495b6ed35/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-02 20:57:27,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:27,819 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:27,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27 WrapperNode [2022-11-02 20:57:27,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:27,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:27,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:27,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:27,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,876 INFO L138 Inliner]: procedures = 130, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-11-02 20:57:27,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:27,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:27,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:27,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:27,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:27,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:27,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:27,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:27,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (1/1) ... [2022-11-02 20:57:27,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:27,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:27,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:57:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:57:28,017 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:57:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:57:28,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:57:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:57:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:57:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:57:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:57:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:28,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:28,245 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:28,758 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:28,765 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:28,765 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:57:28,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:28 BoogieIcfgContainer [2022-11-02 20:57:28,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:28,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:28,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:28,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:28,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:27" (1/3) ... [2022-11-02 20:57:28,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3752a365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:28, skipping insertion in model container [2022-11-02 20:57:28,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:27" (2/3) ... [2022-11-02 20:57:28,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3752a365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:28, skipping insertion in model container [2022-11-02 20:57:28,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:28" (3/3) ... [2022-11-02 20:57:28,778 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-02 20:57:28,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:28,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:57:28,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:28,920 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;@3d8ca877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:28,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:57:28,929 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-02 20:57:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:57:28,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:28,943 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-02 20:57:28,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-02 20:57:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:28,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740322665] [2022-11-02 20:57:28,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:28,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:28,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:57:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:57:29,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:29,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:29,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:29,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740322665] [2022-11-02 20:57:29,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740322665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:29,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:29,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453839085] [2022-11-02 20:57:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:29,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:57:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:57:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:29,412 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:57:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:29,456 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-02 20:57:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:57:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 20:57:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:29,479 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:57:29,480 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:57:29,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:29,493 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:29,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:57:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 20:57:29,560 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-02 20:57:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-02 20:57:29,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-02 20:57:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:29,569 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-02 20:57:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:57:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-02 20:57:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:57:29,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:29,574 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-02 20:57:29,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-02 20:57:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:29,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-02 20:57:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:29,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523043089] [2022-11-02 20:57:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:29,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:29,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:57:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:30,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:57:30,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:30,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:30,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:30,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523043089] [2022-11-02 20:57:30,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523043089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:30,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:30,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853135265] [2022-11-02 20:57:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:30,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:30,111 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:57:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:30,145 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-02 20:57:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-02 20:57:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:30,148 INFO L225 Difference]: With dead ends: 52 [2022-11-02 20:57:30,148 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:57:30,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-02 20:57:30,150 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:30,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:57:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-02 20:57:30,160 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-02 20:57:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-02 20:57:30,162 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-02 20:57:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:30,162 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-02 20:57:30,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:57:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-02 20:57:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:57:30,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:30,165 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-02 20:57:30,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:30,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:30,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-02 20:57:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:30,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161702744] [2022-11-02 20:57:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:30,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:30,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:30,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:57:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:30,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 20:57:30,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:31,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:57:31,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-02 20:57:31,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:31,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-02 20:57:31,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:57:31,629 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-02 20:57:31,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:31,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161702744] [2022-11-02 20:57:31,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161702744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [317380721] [2022-11-02 20:57:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:31,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:31,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:57:31,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:57:31,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-02 20:57:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:32,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:57:32,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:32,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:33,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:33,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-02 20:57:33,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-02 20:57:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:33,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:33,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-02 20:57:33,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:57:33,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-02 20:57:33,342 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:57:33,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:33,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:33,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-11-02 20:57:33,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:33,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:57:33,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [317380721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:33,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:57:33,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2022-11-02 20:57:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126581063] [2022-11-02 20:57:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:57:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:57:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=568, Unknown=9, NotChecked=0, Total=650 [2022-11-02 20:57:33,809 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:57:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:34,227 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-11-02 20:57:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:57:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-02 20:57:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:34,229 INFO L225 Difference]: With dead ends: 34 [2022-11-02 20:57:34,229 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 20:57:34,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=661, Unknown=10, NotChecked=0, Total=756 [2022-11-02 20:57:34,231 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:34,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2022-11-02 20:57:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 20:57:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-02 20:57:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-02 20:57:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-02 20:57:34,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2022-11-02 20:57:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:34,240 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-02 20:57:34,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:57:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-02 20:57:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:57:34,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:34,242 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-02 20:57:34,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-11-02 20:57:34,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:34,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:34,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1130578833, now seen corresponding path program 1 times [2022-11-02 20:57:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:34,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100623118] [2022-11-02 20:57:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:34,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:34,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:57:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:57:34,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:35,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-02 20:57:35,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:35,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-02 20:57:35,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:57:35,629 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-02 20:57:35,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:35,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100623118] [2022-11-02 20:57:35,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100623118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784126532] [2022-11-02 20:57:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:35,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:57:35,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:57:35,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-02 20:57:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:57:36,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:36,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-02 20:57:36,678 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_383) |c_#memory_$Pointer$.base|)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-02 20:57:36,743 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:57:36,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 21 [2022-11-02 20:57:36,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:57:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-02 20:57:36,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:37,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1784126532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:37,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:37,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2022-11-02 20:57:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337495333] [2022-11-02 20:57:37,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:37,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:57:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:57:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=419, Unknown=9, NotChecked=42, Total=552 [2022-11-02 20:57:37,063 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 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-02 20:57:37,289 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_383) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_313)))) (not (= |c_node_create_#res#1.base| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (not (= (_ bv0 32) |c_node_create_~temp~0#1.base|)) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-02 20:57:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:37,748 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-11-02 20:57:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:57:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 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 35 [2022-11-02 20:57:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:37,753 INFO L225 Difference]: With dead ends: 40 [2022-11-02 20:57:37,753 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:57:37,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=580, Unknown=12, NotChecked=102, Total=812 [2022-11-02 20:57:37,755 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:37,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-11-02 20:57:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:57:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-02 20:57:37,763 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-02 20:57:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-02 20:57:37,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 35 [2022-11-02 20:57:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:37,765 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-02 20:57:37,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 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-02 20:57:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-02 20:57:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:57:37,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:37,767 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-02 20:57:37,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:37,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:38,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:38,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:38,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-02 20:57:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:38,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593159245] [2022-11-02 20:57:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:38,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:38,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 20:57:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:57:38,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:38,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:57:38,952 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:57:38,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:57:39,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:39,202 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:39,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-02 20:57:39,412 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-02 20:57:39,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 35 [2022-11-02 20:57:39,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:57:39,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:57:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:39,846 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:39,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 55 [2022-11-02 20:57:39,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:39,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 46 [2022-11-02 20:57:39,931 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 20:57:39,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-11-02 20:57:40,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 32 [2022-11-02 20:57:40,269 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 20:57:40,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 31 [2022-11-02 20:57:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:40,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:40,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:40,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593159245] [2022-11-02 20:57:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593159245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526555135] [2022-11-02 20:57:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:40,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:57:40,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:57:40,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-02 20:57:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 20:57:41,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:41,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:57:42,092 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:57:42,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:57:42,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:42,632 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:42,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-02 20:57:43,075 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:57:43,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 25 [2022-11-02 20:57:43,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:57:43,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:43,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:43,459 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:43,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 52 [2022-11-02 20:57:43,503 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-02 20:57:43,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-11-02 20:57:43,582 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:57:43,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:57:44,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:57:44,521 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:57:44,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 25 [2022-11-02 20:57:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:44,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:45,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1526555135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:45,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:45,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-11-02 20:57:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084436706] [2022-11-02 20:57:45,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:45,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:57:45,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:57:45,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1590, Unknown=9, NotChecked=0, Total=1806 [2022-11-02 20:57:45,008 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 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-02 20:57:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:46,502 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-11-02 20:57:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:57:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 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-02 20:57:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:46,505 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:57:46,505 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:57:46,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=292, Invalid=2147, Unknown=11, NotChecked=0, Total=2450 [2022-11-02 20:57:46,507 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:46,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 229 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 179 Invalid, 0 Unknown, 87 Unchecked, 0.7s Time] [2022-11-02 20:57:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:57:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-11-02 20:57:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:57:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-02 20:57:46,522 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 35 [2022-11-02 20:57:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:46,522 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-02 20:57:46,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 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-02 20:57:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-02 20:57:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:57:46,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:46,525 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-02 20:57:46,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:46,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-11-02 20:57:46,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:46,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-02 20:57:46,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:46,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347933385] [2022-11-02 20:57:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:46,942 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:46,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 20:57:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:47,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-02 20:57:47,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:47,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:57:47,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 20:57:47,493 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:57:47,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:57:47,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:57:47,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:47,942 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-02 20:57:47,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 43 [2022-11-02 20:57:48,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:48,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:48,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:48,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 45 [2022-11-02 20:57:48,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:48,764 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:57:48,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 37 [2022-11-02 20:57:48,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:48,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-11-02 20:57:48,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:49,240 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:49,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 80 [2022-11-02 20:57:49,283 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:57:49,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-02 20:57:49,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:49,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:49,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 65 [2022-11-02 20:57:49,395 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-02 20:57:49,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 20:57:51,186 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-02 20:57:51,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 88 [2022-11-02 20:57:51,293 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:57:51,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 244 treesize of output 147 [2022-11-02 20:57:51,340 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:57:51,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 210 treesize of output 163 [2022-11-02 20:57:51,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2022-11-02 20:57:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:51,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-02 20:57:51,653 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 20:57:51,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 40 [2022-11-02 20:57:51,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:51,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:51,958 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-02 20:57:51,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:52,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (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|) |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_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (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|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:57:52,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:57:52,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:57:52,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:57:53,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:53,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347933385] [2022-11-02 20:57:53,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347933385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336718593] [2022-11-02 20:57:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:57:53,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:57:53,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-02 20:57:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:53,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:57:53,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:54,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:57:54,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 20:57:55,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:55,494 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:57:55,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:57:55,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:55,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:56,227 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:56,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 44 [2022-11-02 20:57:56,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:56,938 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:56,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 36 [2022-11-02 20:57:56,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:57:56,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:56,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:57,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:57,419 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:57,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 73 [2022-11-02 20:57:57,452 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:57:57,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:57,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:57,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:57,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 64 [2022-11-02 20:57:57,537 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 20:57:57,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-11-02 20:57:59,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:59,668 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:57:59,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 111 [2022-11-02 20:57:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:59,751 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-02 20:57:59,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 101 treesize of output 98 [2022-11-02 20:57:59,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-11-02 20:58:00,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:58:00,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 33 [2022-11-02 20:58:00,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:00,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:00,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:00,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |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_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:58:00,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |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|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:58:00,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2022-11-02 20:58:00,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (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|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:58:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [336718593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:01,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:58:01,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2022-11-02 20:58:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143424458] [2022-11-02 20:58:01,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:58:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:58:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:58:01,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2181, Unknown=20, NotChecked=808, Total=3192 [2022-11-02 20:58:01,967 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 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-02 20:58:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:06,168 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-02 20:58:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:58:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 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 37 [2022-11-02 20:58:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:06,173 INFO L225 Difference]: With dead ends: 54 [2022-11-02 20:58:06,173 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 20:58:06,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=276, Invalid=3396, Unknown=20, NotChecked=1000, Total=4692 [2022-11-02 20:58:06,175 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:06,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 237 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 123 Unchecked, 1.1s Time] [2022-11-02 20:58:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 20:58:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-02 20:58:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:58:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-11-02 20:58:06,191 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 37 [2022-11-02 20:58:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:06,192 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-11-02 20:58:06,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 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-02 20:58:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-11-02 20:58:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:58:06,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:06,194 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-02 20:58:06,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-02 20:58:06,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:06,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:58:06,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-02 20:58:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:58:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84514045] [2022-11-02 20:58:06,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:58:06,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:58:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:58:06,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:58:06,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 20:58:07,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:58:07,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:58:07,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-02 20:58:07,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:07,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:58:07,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:58:07,660 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:58:07,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:58:07,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:07,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:07,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:08,056 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-02 20:58:08,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 54 [2022-11-02 20:58:08,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-02 20:58:08,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:08,474 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-11-02 20:58:08,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 69 [2022-11-02 20:58:08,498 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:58:08,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2022-11-02 20:58:08,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:08,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:58:08,987 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-02 20:58:08,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 126 [2022-11-02 20:58:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:09,077 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 20:58:09,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 104 [2022-11-02 20:58:09,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:09,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:58:09,159 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-02 20:58:09,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-02 20:58:09,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 72 [2022-11-02 20:58:09,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 164 [2022-11-02 20:58:11,330 INFO L356 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2022-11-02 20:58:11,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 126 [2022-11-02 20:58:11,470 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:58:11,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 175 [2022-11-02 20:58:11,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 48 [2022-11-02 20:58:11,556 INFO L356 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-11-02 20:58:11,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 116 [2022-11-02 20:58:11,638 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:58:11,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 106 treesize of output 102 [2022-11-02 20:58:11,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-02 20:58:11,908 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:58:11,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 25 [2022-11-02 20:58:11,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:12,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:58:12,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:12,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_866 (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (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_866)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_860) (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_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (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| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:58:12,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_866 (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= |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|)) (.cse1 (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|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_866)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:58:12,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_866 (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (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|)) (.cse3 (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|))) (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_866)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:58:12,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_866 (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (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_866)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:58:12,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_866 (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (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_866)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:58:15,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:58:15,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84514045] [2022-11-02 20:58:15,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84514045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:15,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1904549348] [2022-11-02 20:58:15,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:58:15,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:58:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:58:15,437 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:58:15,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-02 20:58:16,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:58:16,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:58:16,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-02 20:58:16,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:16,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:58:16,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:58:17,085 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:58:17,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:58:17,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:17,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:17,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:17,817 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:58:17,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 46 [2022-11-02 20:58:17,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-11-02 20:58:17,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:18,497 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-02 20:58:18,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 123 treesize of output 61 [2022-11-02 20:58:18,519 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:58:18,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-11-02 20:58:18,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:58:18,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:18,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 12 [2022-11-02 20:58:23,517 INFO L356 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2022-11-02 20:58:23,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 137 treesize of output 100 [2022-11-02 20:58:23,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:23,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:23,584 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-02 20:58:23,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 63 [2022-11-02 20:58:23,633 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-02 20:58:23,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 26 [2022-11-02 20:58:23,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:26,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:26,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_981 (_ BitVec 32)) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_978))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_981))) (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_977) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (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_974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:58:35,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:35,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 949 treesize of output 950 [2022-11-02 20:58:58,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1904549348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:58,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:58:58,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 40 [2022-11-02 20:58:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776986014] [2022-11-02 20:58:58,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:58,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:58:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:58:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:58:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2431, Unknown=26, NotChecked=630, Total=3306 [2022-11-02 20:58:58,816 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:59:09,400 WARN L234 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:59:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:11,214 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-11-02 20:59:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:59:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2022-11-02 20:59:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:11,216 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:59:11,216 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 20:59:11,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=260, Invalid=2818, Unknown=26, NotChecked=678, Total=3782 [2022-11-02 20:59:11,218 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:11,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 266 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 231 Invalid, 0 Unknown, 136 Unchecked, 1.0s Time] [2022-11-02 20:59:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 20:59:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-02 20:59:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:59:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-11-02 20:59:11,233 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 39 [2022-11-02 20:59:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:11,234 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-11-02 20:59:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:59:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-11-02 20:59:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:59:11,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:11,235 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-02 20:59:11,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:11,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:11,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:59:11,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-02 20:59:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:11,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188893161] [2022-11-02 20:59:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:11,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:11,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 20:59:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:11,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:59:12,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:12,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:59:12,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 20:59:12,182 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:59:12,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:59:12,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:59:12,450 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-02 20:59:12,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 43 [2022-11-02 20:59:12,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:12,805 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:12,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-11-02 20:59:13,097 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:59:13,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 30 [2022-11-02 20:59:13,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-11-02 20:59:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:13,457 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:59:13,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 71 [2022-11-02 20:59:13,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:13,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2022-11-02 20:59:13,530 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-02 20:59:13,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 20:59:14,695 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-02 20:59:14,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 145 treesize of output 72 [2022-11-02 20:59:14,814 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:59:14,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 196 treesize of output 121 [2022-11-02 20:59:14,867 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:59:14,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 166 treesize of output 131 [2022-11-02 20:59:14,913 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:14,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 127 [2022-11-02 20:59:15,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 91 [2022-11-02 20:59:15,553 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 20:59:15,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 36 [2022-11-02 20:59:15,772 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-02 20:59:15,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:16,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (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_1081))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (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|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:59:16,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (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_25| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1081))) (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 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-02 20:59:16,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (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_25| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1081))) (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 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-02 20:59:16,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (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 ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1081))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:59:16,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:59:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188893161] [2022-11-02 20:59:16,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188893161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [763470455] [2022-11-02 20:59:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:59:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:59:16,957 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:59:16,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-02 20:59:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:17,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 20:59:17,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:17,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:59:18,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-02 20:59:19,072 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:59:19,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:59:19,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:19,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:19,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:19,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 44 [2022-11-02 20:59:19,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:20,403 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:20,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 [2022-11-02 20:59:20,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-02 20:59:20,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:59:20,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:20,792 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:59:20,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 77 [2022-11-02 20:59:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:20,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:20,822 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:59:20,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 80 [2022-11-02 20:59:20,861 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 20:59:20,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-11-02 20:59:23,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:23,342 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:59:23,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 100 [2022-11-02 20:59:23,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:23,451 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-11-02 20:59:23,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 95 treesize of output 95 [2022-11-02 20:59:24,166 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:59:24,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 52 [2022-11-02 20:59:24,902 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:24,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 29 [2022-11-02 20:59:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:27,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:27,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1176 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1175) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1176) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:59:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [763470455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:33,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:59:33,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 46 [2022-11-02 20:59:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076092443] [2022-11-02 20:59:33,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:59:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:59:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:59:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2769, Unknown=12, NotChecked=550, Total=3540 [2022-11-02 20:59:33,807 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:59:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:38,116 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-02 20:59:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:59:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-11-02 20:59:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:38,118 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:59:38,118 INFO L226 Difference]: Without dead ends: 54 [2022-11-02 20:59:38,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=309, Invalid=4121, Unknown=12, NotChecked=670, Total=5112 [2022-11-02 20:59:38,120 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:38,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2022-11-02 20:59:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-02 20:59:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-02 20:59:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:59:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-11-02 20:59:38,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2022-11-02 20:59:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:38,132 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-11-02 20:59:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:59:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-11-02 20:59:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:59:38,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:38,134 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-02 20:59:38,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-11-02 20:59:38,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:38,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:59:38,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-11-02 20:59:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:38,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384216120] [2022-11-02 20:59:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:38,540 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:38,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-02 20:59:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:38,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-02 20:59:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:39,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-02 20:59:39,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:59:39,673 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:59:39,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 27 [2022-11-02 20:59:39,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:39,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:39,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:39,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:40,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:40,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 63 [2022-11-02 20:59:40,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:40,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:40,471 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-02 20:59:40,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 53 [2022-11-02 20:59:40,495 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:59:40,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:59:40,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:59:40,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:41,128 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:59:41,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 85 [2022-11-02 20:59:41,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:41,187 INFO L356 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-11-02 20:59:41,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 73 [2022-11-02 20:59:41,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:41,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:59:41,258 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-02 20:59:41,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-02 20:59:41,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-11-02 20:59:41,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 35 [2022-11-02 20:59:41,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 55 [2022-11-02 20:59:43,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:44,296 INFO L356 Elim1Store]: treesize reduction 268, result has 18.0 percent of original size [2022-11-02 20:59:44,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:59:44,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384216120] [2022-11-02 20:59:44,297 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 20:59:44,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:44,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:59:44,498 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_145| input size 99 context size 99 output size 99 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-02 20:59:44,501 INFO L158 Benchmark]: Toolchain (without parser) took 137237.49ms. Allocated memory was 73.4MB in the beginning and 142.6MB in the end (delta: 69.2MB). Free memory was 49.7MB in the beginning and 86.0MB in the end (delta: -36.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,501 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 52.4MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:44,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.47ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.12ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,502 INFO L158 Benchmark]: Boogie Preprocessor took 42.07ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,502 INFO L158 Benchmark]: RCFGBuilder took 848.22ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 100.3kB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,502 INFO L158 Benchmark]: TraceAbstraction took 135729.82ms. Allocated memory was 73.4MB in the beginning and 142.6MB in the end (delta: 69.2MB). Free memory was 42.5MB in the beginning and 86.0MB in the end (delta: -43.5MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-02 20:59:44,504 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 52.4MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.47ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.12ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.07ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 848.22ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 100.3kB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 135729.82ms. Allocated memory was 73.4MB in the beginning and 142.6MB in the end (delta: 69.2MB). Free memory was 42.5MB in the beginning and 86.0MB in the end (delta: -43.5MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_145| input size 99 context size 99 output size 99 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_145| input size 99 context size 99 output size 99: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-02 20:59:44,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12352c7-3e0c-4aa8-b537-802495b6ed35/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_145| input size 99 context size 99 output size 99