./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all.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_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- 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:39:59,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:39:59,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:39:59,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:39:59,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:39:59,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:39:59,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:39:59,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:39:59,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:39:59,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:39:59,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:39:59,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:39:59,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:39:59,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:39:59,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:39:59,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:39:59,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:39:59,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:39:59,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:39:59,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:39:59,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:39:59,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:39:59,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:39:59,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:39:59,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:39:59,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:39:59,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:39:59,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:39:59,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:39:59,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:39:59,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:39:59,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:39:59,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:39:59,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:39:59,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:39:59,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:39:59,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:39:59,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:39:59,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:39:59,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:39:59,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:39:59,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:39:59,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:39:59,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:39:59,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:39:59,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:39:59,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:39:59,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:39:59,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:39:59,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:39:59,813 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:39:59,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:39:59,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:39:59,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:39:59,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:39:59,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:39:59,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:39:59,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:39:59,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:39:59,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:39:59,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:39:59,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:39:59,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:39:59,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:39:59,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:39:59,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:39:59,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:39:59,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:39:59,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:39:59,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:39:59,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:39:59,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:39:59,819 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:39:59,819 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:39:59,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:39:59,820 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2022-11-02 20:40:00,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:40:00,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:40:00,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:40:00,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:40:00,169 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:40:00,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-11-02 20:40:00,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/3809cdd9d/b7e496252c9d4f1aa968e4166e3a4c99/FLAG22221681b [2022-11-02 20:40:00,807 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:40:00,808 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-11-02 20:40:00,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/3809cdd9d/b7e496252c9d4f1aa968e4166e3a4c99/FLAG22221681b [2022-11-02 20:40:01,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/3809cdd9d/b7e496252c9d4f1aa968e4166e3a4c99 [2022-11-02 20:40:01,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:40:01,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:40:01,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:01,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:40:01,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:40:01,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd093a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01, skipping insertion in model container [2022-11-02 20:40:01,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:40:01,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:40:01,694 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-11-02 20:40:01,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:01,711 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:40:01,784 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-11-02 20:40:01,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:01,827 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:40:01,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01 WrapperNode [2022-11-02 20:40:01,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:01,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:01,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:40:01,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:40:01,840 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:40:01" (1/1) ... [2022-11-02 20:40:01,879 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:40:01" (1/1) ... [2022-11-02 20:40:01,915 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2022-11-02 20:40:01,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:01,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:40:01,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:40:01,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:40:01,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:40:01,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:40:01,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:40:01,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:40:01,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (1/1) ... [2022-11-02 20:40:01,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:02,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:40:02,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:40:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:40:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:40:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:40:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:40:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:40:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:40:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:40:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:40:02,264 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:40:02,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:40:02,512 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:40:02,518 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:40:02,519 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:40:02,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:02 BoogieIcfgContainer [2022-11-02 20:40:02,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:40:02,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:40:02,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:40:02,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:40:02,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:40:01" (1/3) ... [2022-11-02 20:40:02,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6b4ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:02, skipping insertion in model container [2022-11-02 20:40:02,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:01" (2/3) ... [2022-11-02 20:40:02,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6b4ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:02, skipping insertion in model container [2022-11-02 20:40:02,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:02" (3/3) ... [2022-11-02 20:40:02,539 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2022-11-02 20:40:02,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:40:02,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:40:02,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:40:02,628 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;@3b00ed2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:40:02,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:40:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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:40:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:40:02,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:02,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:02,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1715695268, now seen corresponding path program 1 times [2022-11-02 20:40:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422102268] [2022-11-02 20:40:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422102268] [2022-11-02 20:40:03,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422102268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:03,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:03,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:40:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583615565] [2022-11-02 20:40:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:03,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:03,136 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:03,222 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-11-02 20:40:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-02 20:40:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:03,233 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:40:03,233 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:40:03,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:40:03,246 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:03,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:40:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:40:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:40:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-02 20:40:03,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-02 20:40:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:03,295 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-02 20:40:03,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-02 20:40:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:40:03,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:03,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:40:03,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:03,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1231917993, now seen corresponding path program 1 times [2022-11-02 20:40:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883949619] [2022-11-02 20:40:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:03,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883949619] [2022-11-02 20:40:03,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883949619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:03,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:03,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:40:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598698497] [2022-11-02 20:40:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:03,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:40:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:40:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:03,525 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:03,581 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-11-02 20:40:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:40:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-02 20:40:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:03,584 INFO L225 Difference]: With dead ends: 37 [2022-11-02 20:40:03,584 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:40:03,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:40:03,586 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:03,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:40:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-11-02 20:40:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:40:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-02 20:40:03,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-11-02 20:40:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:03,594 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-02 20:40:03,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:40:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-02 20:40:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:40:03,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:03,596 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, 1, 1] [2022-11-02 20:40:03,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:40:03,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 899729579, now seen corresponding path program 1 times [2022-11-02 20:40:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:03,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911826030] [2022-11-02 20:40:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:40:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:03,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911826030] [2022-11-02 20:40:03,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911826030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:03,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:03,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588337280] [2022-11-02 20:40:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:03,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:40:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:40:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:03,929 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:04,017 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-02 20:40:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:40:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-02 20:40:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:04,023 INFO L225 Difference]: With dead ends: 31 [2022-11-02 20:40:04,023 INFO L226 Difference]: Without dead ends: 27 [2022-11-02 20:40:04,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:04,025 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:04,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-02 20:40:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-11-02 20:40:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:40:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 20:40:04,031 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-11-02 20:40:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:04,032 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 20:40:04,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-02 20:40:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:40:04,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:04,038 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, 1, 1, 1, 1, 1] [2022-11-02 20:40:04,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:40:04,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 491955104, now seen corresponding path program 1 times [2022-11-02 20:40:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167908729] [2022-11-02 20:40:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:40:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:04,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167908729] [2022-11-02 20:40:04,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167908729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:04,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799958964] [2022-11-02 20:40:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:04,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:04,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:40:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:04,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:40:04,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:40:04,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:40:04,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799958964] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:40:04,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:40:04,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-02 20:40:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585144645] [2022-11-02 20:40:04,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:04,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:40:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:40:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:40:04,713 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:04,809 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-11-02 20:40:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:40:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-02 20:40:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:04,812 INFO L225 Difference]: With dead ends: 32 [2022-11-02 20:40:04,812 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:40:04,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:40:04,814 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:04,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 83 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:40:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 20:40:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:40:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 20:40:04,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 29 [2022-11-02 20:40:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:04,821 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 20:40:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 20:40:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:40:04,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:04,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:04,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:05,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:05,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1349916533, now seen corresponding path program 2 times [2022-11-02 20:40:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:05,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917083184] [2022-11-02 20:40:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:40:05,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917083184] [2022-11-02 20:40:05,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917083184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:05,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:05,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878537754] [2022-11-02 20:40:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:05,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:40:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:40:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:40:05,467 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:05,623 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-11-02 20:40:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:40:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-02 20:40:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:05,625 INFO L225 Difference]: With dead ends: 37 [2022-11-02 20:40:05,626 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:40:05,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:05,627 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:05,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:40:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-11-02 20:40:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:40:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 20:40:05,636 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2022-11-02 20:40:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:05,637 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 20:40:05,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 20:40:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:40:05,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:05,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:05,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:05,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1292658231, now seen corresponding path program 1 times [2022-11-02 20:40:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:05,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680403426] [2022-11-02 20:40:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:05,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:40:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680403426] [2022-11-02 20:40:06,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680403426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373642855] [2022-11-02 20:40:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:06,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:06,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:40:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:07,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:40:07,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:07,128 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:40:07,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:40:07,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:40:07,379 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:40:07,452 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:07,458 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 26 treesize of output 27 [2022-11-02 20:40:07,603 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 20:40:07,604 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 2 case distinctions, treesize of input 58 treesize of output 31 [2022-11-02 20:40:07,835 INFO L356 Elim1Store]: treesize reduction 52, result has 35.8 percent of original size [2022-11-02 20:40:07,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 51 [2022-11-02 20:40:07,841 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 29 treesize of output 21 [2022-11-02 20:40:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:40:07,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:07,893 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 29 treesize of output 21 [2022-11-02 20:40:09,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) is different from false [2022-11-02 20:40:11,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-02 20:40:11,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_728))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-02 20:40:11,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:40:11,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 185 [2022-11-02 20:40:12,194 INFO L356 Elim1Store]: treesize reduction 415, result has 39.1 percent of original size [2022-11-02 20:40:12,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 200201 treesize of output 188248 [2022-11-02 20:40:15,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:40:15,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 626235 treesize of output 581539 [2022-11-02 20:41:36,174 WARN L234 SmtUtils]: Spent 1.34m on a formula simplification. DAG size of input: 1790 DAG size of output: 1767 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:42:49,221 WARN L234 SmtUtils]: Spent 17.34s on a formula simplification. DAG size of input: 494 DAG size of output: 485 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:43:09,949 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 6 treesize of output 4 [2022-11-02 20:43:10,198 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 6 treesize of output 4 [2022-11-02 20:43:10,406 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:43:10,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:43:10,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:10,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 173 [2022-11-02 20:43:10,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:10,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 428 treesize of output 413 [2022-11-02 20:43:10,968 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:43:10,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 581 treesize of output 1 [2022-11-02 20:43:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-02 20:43:11,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373642855] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:11,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2022-11-02 20:43:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956621840] [2022-11-02 20:43:11,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:43:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:43:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1163, Unknown=3, NotChecked=210, Total=1482 [2022-11-02 20:43:11,343 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:43:11,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_728))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-02 20:43:13,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-02 20:43:14,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))))) is different from false [2022-11-02 20:43:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:14,609 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-02 20:43:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:43:14,610 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-11-02 20:43:14,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:14,611 INFO L225 Difference]: With dead ends: 46 [2022-11-02 20:43:14,611 INFO L226 Difference]: Without dead ends: 37 [2022-11-02 20:43:14,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=135, Invalid=1365, Unknown=6, NotChecked=474, Total=1980 [2022-11-02 20:43:14,614 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:14,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 250 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-11-02 20:43:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-02 20:43:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-02 20:43:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:43:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-11-02 20:43:14,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 32 [2022-11-02 20:43:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:14,623 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-11-02 20:43:14,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:43:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-11-02 20:43:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:14,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:14,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:14,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:43:14,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -612599861, now seen corresponding path program 1 times [2022-11-02 20:43:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252361800] [2022-11-02 20:43:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:43:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:43:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252361800] [2022-11-02 20:43:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252361800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793045806] [2022-11-02 20:43:17,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:17,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:17,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:43:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-02 20:43:17,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:17,609 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:43:17,964 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:17,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:43:18,031 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:43:18,038 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:43:18,118 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:43:18,128 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:43:18,315 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 20:43:18,316 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 94 treesize of output 55 [2022-11-02 20:43:18,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:18,327 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 28 treesize of output 25 [2022-11-02 20:43:18,332 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 16 treesize of output 20 [2022-11-02 20:43:19,407 INFO L356 Elim1Store]: treesize reduction 647, result has 18.4 percent of original size [2022-11-02 20:43:19,409 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 20:43:19,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:19,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,610 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_58| input size 161 context size 161 output size 161 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:122) 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:43:19,613 INFO L158 Benchmark]: Toolchain (without parser) took 198496.98ms. Allocated memory was 111.1MB in the beginning and 736.1MB in the end (delta: 625.0MB). Free memory was 70.7MB in the beginning and 273.7MB in the end (delta: -203.0MB). Peak memory consumption was 422.0MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,613 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:43:19,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.75ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 77.9MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.76ms. Allocated memory is still 111.1MB. Free memory was 77.9MB in the beginning and 76.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,614 INFO L158 Benchmark]: Boogie Preprocessor took 60.74ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,614 INFO L158 Benchmark]: RCFGBuilder took 543.46ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 59.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,614 INFO L158 Benchmark]: TraceAbstraction took 197088.28ms. Allocated memory was 111.1MB in the beginning and 736.1MB in the end (delta: 625.0MB). Free memory was 58.4MB in the beginning and 273.7MB in the end (delta: -215.3MB). Peak memory consumption was 411.7MB. Max. memory is 16.1GB. [2022-11-02 20:43:19,617 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.23ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.75ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 77.9MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.76ms. Allocated memory is still 111.1MB. Free memory was 77.9MB in the beginning and 76.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.74ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.46ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 59.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 197088.28ms. Allocated memory was 111.1MB in the beginning and 736.1MB in the end (delta: 625.0MB). Free memory was 58.4MB in the beginning and 273.7MB in the end (delta: -215.3MB). Peak memory consumption was 411.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_58| input size 161 context size 161 output size 161 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_58| input size 161 context size 161 output size 161: 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:43:19,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- 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:43:22,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:22,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:22,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:22,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:22,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:22,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:22,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:22,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:22,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:22,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:22,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:22,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:22,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:22,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:22,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:22,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:22,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:22,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:22,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:22,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:22,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:22,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:22,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:22,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:22,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:22,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:22,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:22,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:22,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:22,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:22,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:22,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:22,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:22,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:22,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:22,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:22,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:22,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:22,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:22,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:22,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:43:22,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:22,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:22,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:22,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:22,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:22,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:22,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:22,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:22,291 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:22,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:22,293 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:43:22,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:43:22,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:22,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:43:22,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:22,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:43:22,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:43:22,295 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:43:22,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:43:22,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:43:22,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:43:22,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:22,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:43:22,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:22,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:22,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:22,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:22,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:22,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:22,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:43:22,298 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:43:22,298 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:43:22,299 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:43:22,299 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:43:22,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:43:22,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:43:22,300 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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_06f296f5-ef85-40d9-b52d-bda86a08ee95/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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2022-11-02 20:43:22,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:22,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:22,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:22,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:22,758 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:22,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-11-02 20:43:22,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/d5239f81b/3d08006449b040bdaf93fdfb1855f869/FLAG768c3499e [2022-11-02 20:43:23,534 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:23,535 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-11-02 20:43:23,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/d5239f81b/3d08006449b040bdaf93fdfb1855f869/FLAG768c3499e [2022-11-02 20:43:23,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/data/d5239f81b/3d08006449b040bdaf93fdfb1855f869 [2022-11-02 20:43:23,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:23,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:23,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:23,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:23,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:23,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:23" (1/1) ... [2022-11-02 20:43:23,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71301668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:23, skipping insertion in model container [2022-11-02 20:43:23,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:23" (1/1) ... [2022-11-02 20:43:23,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:23,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:24,179 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-11-02 20:43:24,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:24,194 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:24,235 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_06f296f5-ef85-40d9-b52d-bda86a08ee95/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-11-02 20:43:24,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:24,264 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:24,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24 WrapperNode [2022-11-02 20:43:24,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:24,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:24,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:24,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:24,274 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:43:24" (1/1) ... [2022-11-02 20:43:24,291 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:43:24" (1/1) ... [2022-11-02 20:43:24,313 INFO L138 Inliner]: procedures = 129, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2022-11-02 20:43:24,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:24,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:24,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:24,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:24,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,344 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:24,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:24,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:24,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:24,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (1/1) ... [2022-11-02 20:43:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:24,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:24,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:43:24,447 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:43:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:43:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:43:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:43:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:43:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:43:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:43:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:43:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:43:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:24,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:24,576 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:24,579 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:24,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:24,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:24,973 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:43:24,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:24 BoogieIcfgContainer [2022-11-02 20:43:24,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:24,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:24,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:24,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:24,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:23" (1/3) ... [2022-11-02 20:43:24,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7265c292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:24, skipping insertion in model container [2022-11-02 20:43:24,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:24" (2/3) ... [2022-11-02 20:43:24,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7265c292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:24, skipping insertion in model container [2022-11-02 20:43:24,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:24" (3/3) ... [2022-11-02 20:43:24,985 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2022-11-02 20:43:25,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:25,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:43:25,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:25,100 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;@358dcd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:25,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:43:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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:43:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:43:25,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:25,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:25,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1715695268, now seen corresponding path program 1 times [2022-11-02 20:43:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932606439] [2022-11-02 20:43:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:25,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:25,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:43:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:43:25,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:25,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:25,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:43:25,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932606439] [2022-11-02 20:43:25,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932606439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:25,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:25,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:25,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041688735] [2022-11-02 20:43:25,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:25,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:43:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:43:25,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:43:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:43:25,449 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:25,476 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-11-02 20:43:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:43:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-02 20:43:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:25,496 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:43:25,499 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:43:25,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:43:25,509 INFO L413 NwaCegarLoop]: 32 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, 32 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:43:25,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:43:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:43:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:43:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-02 20:43:25,560 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-02 20:43:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:25,562 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-02 20:43:25,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-02 20:43:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:43:25,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:25,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:25,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:25,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:43:25,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1231917993, now seen corresponding path program 1 times [2022-11-02 20:43:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:25,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287085127] [2022-11-02 20:43:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:25,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:25,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:43:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:43:25,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:26,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:26,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:43:26,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287085127] [2022-11-02 20:43:26,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287085127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:26,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:26,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296175430] [2022-11-02 20:43:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:26,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:43:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:26,062 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:26,091 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-11-02 20:43:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-02 20:43:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:26,095 INFO L225 Difference]: With dead ends: 37 [2022-11-02 20:43:26,100 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:43:26,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:43:26,103 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 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:43:26,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:43:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-11-02 20:43:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:43:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-02 20:43:26,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-11-02 20:43:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:26,119 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-02 20:43:26,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-02 20:43:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:43:26,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:26,122 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, 1, 1] [2022-11-02 20:43:26,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:26,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:43:26,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 899729579, now seen corresponding path program 1 times [2022-11-02 20:43:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:26,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042292810] [2022-11-02 20:43:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:26,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:26,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:26,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:26,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:43:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:26,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:26,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:43:26,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:26,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:43:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042292810] [2022-11-02 20:43:26,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042292810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:26,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:26,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448841174] [2022-11-02 20:43:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:26,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:43:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:26,608 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:43:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:26,643 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-02 20:43:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:26,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-02 20:43:26,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:26,645 INFO L225 Difference]: With dead ends: 31 [2022-11-02 20:43:26,646 INFO L226 Difference]: Without dead ends: 27 [2022-11-02 20:43:26,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:26,647 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:26,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-02 20:43:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-11-02 20:43:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:43:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 20:43:26,655 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-11-02 20:43:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:26,656 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 20:43:26,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:43:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-02 20:43:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:43:26,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:26,657 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, 1, 1, 1, 1, 1] [2022-11-02 20:43:26,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:26,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:43:26,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 491955104, now seen corresponding path program 1 times [2022-11-02 20:43:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:26,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850671162] [2022-11-02 20:43:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:26,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:26,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:43:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:43:27,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:43:27,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:43:27,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:43:27,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850671162] [2022-11-02 20:43:27,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850671162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:27,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:27,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-02 20:43:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020282373] [2022-11-02 20:43:27,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:27,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:43:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:43:27,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:43:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:27,326 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:43:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:27,412 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-11-02 20:43:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-02 20:43:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:27,416 INFO L225 Difference]: With dead ends: 34 [2022-11-02 20:43:27,416 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:43:27,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:27,426 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:27,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:43:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-11-02 20:43:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:43:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 20:43:27,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 29 [2022-11-02 20:43:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:27,438 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 20:43:27,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:43:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 20:43:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:27,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:27,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:27,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:27,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:43:27,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1349916533, now seen corresponding path program 2 times [2022-11-02 20:43:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613643348] [2022-11-02 20:43:27,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:27,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:27,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:27,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:43:27,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:27,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:27,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:43:27,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:28,008 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:43:28,016 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:43:28,064 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:43:28,068 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:43:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:43:28,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:28,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:43:28,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613643348] [2022-11-02 20:43:28,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613643348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:28,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:28,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:43:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473152644] [2022-11-02 20:43:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:28,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:43:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:28,093 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:43:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:28,701 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-11-02 20:43:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-02 20:43:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:28,703 INFO L225 Difference]: With dead ends: 37 [2022-11-02 20:43:28,703 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:43:28,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:28,704 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:28,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:43:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:43:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-11-02 20:43:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:43:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 20:43:28,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2022-11-02 20:43:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:28,712 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 20:43:28,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:43:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 20:43:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:28,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:28,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:28,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:43:28,930 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1292658231, now seen corresponding path program 1 times [2022-11-02 20:43:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:43:28,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328634451] [2022-11-02 20:43:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:43:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:43:28,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:43:28,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f296f5-ef85-40d9-b52d-bda86a08ee95/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:43:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:29,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:43:29,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:29,268 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:43:29,482 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:43:29,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:43:29,560 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:43:29,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, 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:43:29,809 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-02 20:43:29,810 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 52 treesize of output 29 [2022-11-02 20:43:30,019 INFO L356 Elim1Store]: treesize reduction 59, result has 18.1 percent of original size [2022-11-02 20:43:30,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 32 [2022-11-02 20:43:30,029 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:43:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:43:30,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:30,160 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 29 treesize of output 21 [2022-11-02 20:43:32,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse0)))))) is different from false [2022-11-02 20:43:34,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:43:34,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_393))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:43:34,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:34,458 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 185 [2022-11-02 20:43:37,791 INFO L356 Elim1Store]: treesize reduction 425, result has 37.6 percent of original size [2022-11-02 20:43:37,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 369029 treesize of output 316984 [2022-11-02 20:43:40,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:40,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 451874 treesize of output 425232 [2022-11-02 20:43:56,711 WARN L234 SmtUtils]: Spent 15.88s on a formula simplification. DAG size of input: 1590 DAG size of output: 1586 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)