./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- 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-03 02:53:23,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:53:23,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:53:23,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:53:23,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:53:23,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:53:23,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:53:23,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:53:23,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:53:23,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:53:23,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:53:23,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:53:23,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:53:23,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:53:23,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:53:23,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:53:23,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:53:23,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:53:23,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:53:23,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:53:23,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:53:23,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:53:23,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:53:23,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:53:23,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:53:23,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:53:23,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:53:23,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:53:23,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:53:23,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:53:23,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:53:23,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:53:23,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:53:23,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:53:23,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:53:23,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:53:23,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:53:23,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:53:23,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:53:23,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:53:23,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:53:23,871 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:53:23,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:53:23,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:53:23,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:53:23,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:53:23,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:53:23,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:53:23,908 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:53:23,909 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:53:23,909 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:53:23,909 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:53:23,910 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:53:23,910 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:53:23,911 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:53:23,911 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:53:23,911 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:53:23,911 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:53:23,912 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:53:23,912 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:53:23,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:53:23,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:53:23,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:53:23,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:53:23,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:53:23,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:53:23,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:53:23,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:53:23,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:53:23,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:53:23,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:53:23,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:53:23,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:53:23,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:53:23,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:53:23,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:53:23,916 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:53:23,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:53:23,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:53:23,917 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:53:23,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:53:23,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:53:23,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:53:23,918 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-11-03 02:53:24,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:53:24,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:53:24,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:53:24,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:53:24,211 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:53:24,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-03 02:53:24,305 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/621ccdc85/05dae6933b494b01a56e94cb121fe8d1/FLAG6a454b09b [2022-11-03 02:53:24,900 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:53:24,909 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-03 02:53:24,928 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/621ccdc85/05dae6933b494b01a56e94cb121fe8d1/FLAG6a454b09b [2022-11-03 02:53:25,169 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/621ccdc85/05dae6933b494b01a56e94cb121fe8d1 [2022-11-03 02:53:25,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:53:25,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:53:25,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:25,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:53:25,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:53:25,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422f5304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25, skipping insertion in model container [2022-11-03 02:53:25,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:53:25,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:53:25,673 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-03 02:53:25,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:25,690 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:53:25,752 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-03 02:53:25,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:25,787 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:53:25,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25 WrapperNode [2022-11-03 02:53:25,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:25,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:53:25,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:53:25,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:53:25,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,867 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2022-11-03 02:53:25,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:53:25,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:53:25,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:53:25,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:53:25,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:53:25,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:53:25,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:53:25,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:53:25,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (1/1) ... [2022-11-03 02:53:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:53:25,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:25,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:53:26,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:53:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:53:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:53:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:53:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:53:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:53:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:53:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:53:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:53:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:53:26,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:53:26,218 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:53:26,606 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:53:26,774 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:53:26,774 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 02:53:26,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:53:26 BoogieIcfgContainer [2022-11-03 02:53:26,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:53:26,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:53:26,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:53:26,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:53:26,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:53:25" (1/3) ... [2022-11-03 02:53:26,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c2d362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:53:26, skipping insertion in model container [2022-11-03 02:53:26,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:25" (2/3) ... [2022-11-03 02:53:26,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c2d362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:53:26, skipping insertion in model container [2022-11-03 02:53:26,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:53:26" (3/3) ... [2022-11-03 02:53:26,785 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-11-03 02:53:26,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:53:26,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:53:26,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:53:26,858 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=FINITE_AUTOMATA, 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;@32757bec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:53:26,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:53:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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-03 02:53:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:53:26,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:26,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:26,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:53:26,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash -170983099, now seen corresponding path program 1 times [2022-11-03 02:53:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:26,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686983625] [2022-11-03 02:53:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:53:27,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:27,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686983625] [2022-11-03 02:53:27,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686983625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:27,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:27,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:53:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860004453] [2022-11-03 02:53:27,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:27,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:53:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:53:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:53:27,831 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 02:53:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:28,128 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2022-11-03 02:53:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:53:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-03 02:53:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:28,138 INFO L225 Difference]: With dead ends: 53 [2022-11-03 02:53:28,138 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:53:28,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 02:53:28,144 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:28,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:53:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:53:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 02:53:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-03 02:53:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-11-03 02:53:28,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-11-03 02:53:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:28,185 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-11-03 02:53:28,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 02:53:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-11-03 02:53:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:53:28,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:28,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:28,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:53:28,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:53:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash 299889229, now seen corresponding path program 1 times [2022-11-03 02:53:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:28,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714560609] [2022-11-03 02:53:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:53:28,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:28,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714560609] [2022-11-03 02:53:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714560609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:53:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614527222] [2022-11-03 02:53:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:28,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:53:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:53:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:53:28,831 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:53:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:29,112 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2022-11-03 02:53:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:53:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-11-03 02:53:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:29,115 INFO L225 Difference]: With dead ends: 36 [2022-11-03 02:53:29,115 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:53:29,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:53:29,117 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:29,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:53:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:53:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 02:53:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-03 02:53:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-11-03 02:53:29,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2022-11-03 02:53:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:29,124 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-11-03 02:53:29,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:53:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-11-03 02:53:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:53:29,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:29,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:29,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:53:29,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:53:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash 593391176, now seen corresponding path program 1 times [2022-11-03 02:53:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:29,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771593507] [2022-11-03 02:53:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:53:55,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:55,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771593507] [2022-11-03 02:53:55,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771593507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557642996] [2022-11-03 02:53:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:55,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:55,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:55,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:55,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:53:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:57,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-03 02:53:57,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:57,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-03 02:53:57,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:53:57,884 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 13 treesize of output 9 [2022-11-03 02:53:58,046 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:53:58,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:53:58,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:53:58,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:53:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:53:58,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:53:58,490 INFO L356 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-03 02:53:58,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 82 [2022-11-03 02:53:58,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2022-11-03 02:53:58,528 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 18 treesize of output 26 [2022-11-03 02:53:58,784 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 02:53:58,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 45 [2022-11-03 02:53:58,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:58,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:53:58,821 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-03 02:53:59,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:59,075 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 02:53:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 95 [2022-11-03 02:53:59,104 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:53:59,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:53:59,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:53:59,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:59,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:00,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:00,392 INFO L356 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-11-03 02:54:00,392 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 286 treesize of output 131 [2022-11-03 02:54:00,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:00,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-11-03 02:54:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:00,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:00,462 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-03 02:54:00,476 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 48 treesize of output 46 [2022-11-03 02:54:00,487 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 46 treesize of output 42 [2022-11-03 02:54:00,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:54:00,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:54:00,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:01,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0))) (and (or (not .cse0) (not .cse1) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (.cse3 (= .cse5 0))) (and (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2088 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not .cse2) (not .cse3)) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2122 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (v_ArrVal_2110 (Array Int Int)) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2091 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2074) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2097) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2122) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2061) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2123) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2100) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse5))) (store .cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2094) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2071) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2063) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2077) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2119) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2106) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2110) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (and .cse2 .cse3)))))) (or (and .cse0 .cse1) (forall ((v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2073 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_2082)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2114) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2101) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2066) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2128) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2117) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2022-11-03 02:54:01,505 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0))) (and (forall ((v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2073 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2082)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2073) .cse1 v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2114) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2101) .cse1 v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2066) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2128) .cse1 v_ArrVal_2117) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| 0))) (or .cse2 (forall ((v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2073 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2082)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2073) .cse1 v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2114) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2101) .cse1 v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2066) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2128) .cse1 v_ArrVal_2117) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (or (not .cse2) (not (<= 0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (.cse4 (= .cse6 0))) (and (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2088 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not .cse3) (not .cse4)) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2122 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (v_ArrVal_2110 (Array Int Int)) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2091 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2074) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2097) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2122) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2061) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2123) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2100) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse6))) (store .cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2094) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2071) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2063) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2077) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2119) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2106) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2110) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (and .cse3 .cse4)))))))) is different from false [2022-11-03 02:54:01,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select |c_#memory_int| .cse2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse0 (= .cse2 0))) (and (or (not .cse0) (let ((.cse3 (= .cse4 0))) (and (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2122 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (v_ArrVal_2110 (Array Int Int)) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2091 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2074) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2097) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2122) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2061) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2123) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2100) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse2))) (store .cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| .cse1) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2094) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2071) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2063) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2077) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2119) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2106) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2110) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) .cse3) (or (forall ((v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2088 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2088) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2102) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not .cse3)))) (not (<= 0 .cse4))) (forall ((v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2073 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse5 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2082)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2073) .cse6 v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2114) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2101) .cse6 v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2066) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2128) .cse6 v_ArrVal_2117) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| 0))) (or (forall ((v_ArrVal_2092 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2073 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse5 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2082)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2073) .cse6 v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2114) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2101) .cse6 v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2066) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2128) .cse6 v_ArrVal_2117) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse0)))) is different from false [2022-11-03 02:54:03,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557642996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:03,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593721186] [2022-11-03 02:54:03,073 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:54:03,073 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:54:03,077 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:54:03,082 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:54:03,083 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:54:03,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,147 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:54:03,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 02:54:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:54:03,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-03 02:54:03,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:54:03,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:54:03,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:54:03,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:54:03,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:54:03,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:54:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:54:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:54:03,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:54:03,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:54:03,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,677 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:54:03,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:54:03,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,710 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:54:03,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:54:03,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:03,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:54:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:54:03,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:03,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:03,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:54:04,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 237 [2022-11-03 02:54:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,120 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:54:04,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 360 treesize of output 371 [2022-11-03 02:54:04,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,169 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:54:04,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 372 treesize of output 262 [2022-11-03 02:54:04,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2022-11-03 02:54:04,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,323 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 29 treesize of output 17 [2022-11-03 02:54:04,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,345 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 29 treesize of output 17 [2022-11-03 02:54:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,368 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 35 treesize of output 7 [2022-11-03 02:54:04,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,632 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:04,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:54:04,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,662 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:04,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:54:04,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,806 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:04,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:54:04,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:04,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:04,851 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:04,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:54:05,320 INFO L356 Elim1Store]: treesize reduction 122, result has 32.6 percent of original size [2022-11-03 02:54:05,320 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 3 case distinctions, treesize of input 71 treesize of output 68 [2022-11-03 02:54:05,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:05,465 INFO L356 Elim1Store]: treesize reduction 141, result has 22.1 percent of original size [2022-11-03 02:54:05,465 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 3 case distinctions, treesize of input 71 treesize of output 49 [2022-11-03 02:54:05,551 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:54:05,552 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 1 case distinctions, treesize of input 35 treesize of output 17 [2022-11-03 02:54:05,601 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 02:54:05,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-11-03 02:54:05,649 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:54:05,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:54:05,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:05,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:13,919 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 111 DAG size of output: 63 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:54:13,919 INFO L356 Elim1Store]: treesize reduction 1068, result has 19.3 percent of original size [2022-11-03 02:54:13,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:54:14,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:14,123 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_122| input size 202 context size 202 output size 202 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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-03 02:54:14,127 INFO L158 Benchmark]: Toolchain (without parser) took 48954.12ms. Allocated memory was 107.0MB in the beginning and 809.5MB in the end (delta: 702.5MB). Free memory was 73.0MB in the beginning and 633.4MB in the end (delta: -560.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,127 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:54:14,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.45ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 73.0MB in the end (delta: -200.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.94ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,128 INFO L158 Benchmark]: Boogie Preprocessor took 65.50ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,128 INFO L158 Benchmark]: RCFGBuilder took 841.47ms. Allocated memory is still 107.0MB. Free memory was 68.4MB in the beginning and 69.7MB in the end (delta: -1.3MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,129 INFO L158 Benchmark]: TraceAbstraction took 47347.47ms. Allocated memory was 107.0MB in the beginning and 809.5MB in the end (delta: 702.5MB). Free memory was 68.6MB in the beginning and 633.4MB in the end (delta: -564.8MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2022-11-03 02:54:14,130 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.17ms. Allocated memory is still 77.6MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.45ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 73.0MB in the end (delta: -200.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.94ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.50ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 841.47ms. Allocated memory is still 107.0MB. Free memory was 68.4MB in the beginning and 69.7MB in the end (delta: -1.3MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 47347.47ms. Allocated memory was 107.0MB in the beginning and 809.5MB in the end (delta: 702.5MB). Free memory was 68.6MB in the beginning and 633.4MB in the end (delta: -564.8MB). Peak memory consumption was 138.8MB. 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_122| input size 202 context size 202 output size 202 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_122| input size 202 context size 202 output size 202: 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-03 02:54:14,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- 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-03 02:54:16,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:54:16,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:54:16,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:54:16,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:54:16,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:54:16,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:54:16,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:54:16,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:54:16,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:54:16,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:54:16,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:54:16,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:54:16,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:54:16,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:54:16,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:54:16,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:54:16,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:54:16,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:54:16,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:54:16,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:54:16,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:54:16,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:54:16,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:54:16,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:54:16,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:54:16,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:54:16,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:54:16,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:54:16,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:54:16,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:54:16,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:54:16,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:54:16,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:54:16,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:54:16,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:54:16,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:54:16,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:54:16,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:54:16,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:54:16,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:54:16,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:54:16,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:54:16,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:54:16,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:54:16,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:54:16,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:54:16,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:54:16,694 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:54:16,694 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:54:16,694 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:54:16,695 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:54:16,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:54:16,696 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:54:16,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:54:16,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:54:16,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:54:16,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:54:16,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:54:16,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:54:16,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:54:16,699 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:54:16,699 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:54:16,700 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:54:16,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:54:16,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:54:16,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:54:16,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:54:16,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:54:16,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:54:16,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:54:16,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:54:16,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:54:16,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:54:16,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:54:16,702 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:54:16,703 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:16,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:54:16,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:54:16,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:54:16,704 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-11-03 02:54:17,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:54:17,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:54:17,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:54:17,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:54:17,086 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:54:17,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-03 02:54:17,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/eb7c2686b/a5291a9330ee40dcb7cb8452ca14583e/FLAG4c02a7723 [2022-11-03 02:54:17,696 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:54:17,697 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-03 02:54:17,710 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/eb7c2686b/a5291a9330ee40dcb7cb8452ca14583e/FLAG4c02a7723 [2022-11-03 02:54:18,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/data/eb7c2686b/a5291a9330ee40dcb7cb8452ca14583e [2022-11-03 02:54:18,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:54:18,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:54:18,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:54:18,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:54:18,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:54:18,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e12920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18, skipping insertion in model container [2022-11-03 02:54:18,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:54:18,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:54:18,458 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-03 02:54:18,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:54:18,489 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:54:18,563 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_ceb2237a-ebfd-4af8-980e-f62aa12d5399/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-03 02:54:18,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:54:18,592 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:54:18,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18 WrapperNode [2022-11-03 02:54:18,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:54:18,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:54:18,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:54:18,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:54:18,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,643 INFO L138 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-11-03 02:54:18,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:54:18,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:54:18,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:54:18,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:54:18,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,698 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:54:18,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:54:18,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:54:18,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:54:18,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (1/1) ... [2022-11-03 02:54:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:54:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:18,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:54:18,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:54:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:54:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:54:18,796 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:54:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:54:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:54:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:54:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:54:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:54:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:54:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:54:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:54:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:54:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:54:18,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:54:19,043 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:54:19,045 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:54:19,749 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:54:19,756 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:54:19,756 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 02:54:19,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:54:19 BoogieIcfgContainer [2022-11-03 02:54:19,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:54:19,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:54:19,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:54:19,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:54:19,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:54:18" (1/3) ... [2022-11-03 02:54:19,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189f89fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:54:19, skipping insertion in model container [2022-11-03 02:54:19,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:54:18" (2/3) ... [2022-11-03 02:54:19,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189f89fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:54:19, skipping insertion in model container [2022-11-03 02:54:19,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:54:19" (3/3) ... [2022-11-03 02:54:19,767 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-11-03 02:54:19,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:54:19,787 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:54:19,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:54:19,843 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=FINITE_AUTOMATA, 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;@2d69b0d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:54:19,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:54:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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-03 02:54:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:54:19,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:19,855 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] [2022-11-03 02:54:19,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-11-03 02:54:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:19,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442421245] [2022-11-03 02:54:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:19,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:19,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:54:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:20,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:54:20,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:54:20,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:20,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442421245] [2022-11-03 02:54:20,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442421245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:20,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:20,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:54:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357853176] [2022-11-03 02:54:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:54:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:54:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:54:20,290 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:54:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:20,312 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-11-03 02:54:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:54:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-03 02:54:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:20,322 INFO L225 Difference]: With dead ends: 79 [2022-11-03 02:54:20,322 INFO L226 Difference]: Without dead ends: 36 [2022-11-03 02:54:20,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-03 02:54:20,329 INFO L413 NwaCegarLoop]: 58 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, 58 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-03 02:54:20,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:54:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-03 02:54:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-03 02:54:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-03 02:54:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-11-03 02:54:20,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-11-03 02:54:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:20,371 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-11-03 02:54:20,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:54:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-11-03 02:54:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:54:20,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:20,374 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] [2022-11-03 02:54:20,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:20,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:20,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-11-03 02:54:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:20,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674391460] [2022-11-03 02:54:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:20,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:20,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:20,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:20,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:54:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:20,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:54:20,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:54:20,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:20,905 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:20,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674391460] [2022-11-03 02:54:20,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674391460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:20,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:20,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778761867] [2022-11-03 02:54:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:20,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:54:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:54:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:54:20,915 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:54:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:20,940 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-03 02:54:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:54:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-03 02:54:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:20,949 INFO L225 Difference]: With dead ends: 68 [2022-11-03 02:54:20,949 INFO L226 Difference]: Without dead ends: 41 [2022-11-03 02:54:20,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-03 02:54:20,952 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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-03 02:54:20,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:54:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-03 02:54:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-11-03 02:54:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-03 02:54:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-11-03 02:54:20,971 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-11-03 02:54:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:20,972 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-11-03 02:54:20,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:54:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-11-03 02:54:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:54:20,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:20,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:20,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:21,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:21,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-11-03 02:54:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629868244] [2022-11-03 02:54:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:21,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:21,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:21,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:54:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:21,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:54:21,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:21,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:21,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629868244] [2022-11-03 02:54:21,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629868244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:21,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:21,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300835281] [2022-11-03 02:54:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:21,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:21,565 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:54:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:21,634 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-11-03 02:54:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:54:21,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-03 02:54:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:21,637 INFO L225 Difference]: With dead ends: 55 [2022-11-03 02:54:21,638 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 02:54:21,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:54:21,642 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:21,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:54:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 02:54:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-03 02:54:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-03 02:54:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-11-03 02:54:21,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 35 [2022-11-03 02:54:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:21,659 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-11-03 02:54:21,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:54:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-11-03 02:54:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:54:21,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:21,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:21,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:21,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-11-03 02:54:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:21,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981910322] [2022-11-03 02:54:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:21,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:21,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:54:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:22,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-03 02:54:22,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:22,529 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-03 02:54:22,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:54:22,822 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:54:22,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:54:23,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:54:23,198 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-03 02:54:23,380 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 02:54:23,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 02:54:23,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:23,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:54:23,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:23,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:24,404 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-03 02:54:24,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:24,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981910322] [2022-11-03 02:54:24,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_48| input size 65 context size 65 output size 65 [2022-11-03 02:54:24,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7439323] [2022-11-03 02:54:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:24,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:24,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:24,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-03 02:54:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:25,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-03 02:54:25,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:25,422 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-03 02:54:25,972 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-03 02:54:26,174 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:54:26,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:54:26,414 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-03 02:54:26,428 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-03 02:54:26,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:54:26,654 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-03 02:54:26,669 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-03 02:54:26,715 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-03 02:54:27,336 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-03 02:54:27,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_51| input size 66 context size 66 output size 66 [2022-11-03 02:54:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224897913] [2022-11-03 02:54:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:27,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:27,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:27,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:27,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:54:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:27,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-03 02:54:27,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:27,614 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-03 02:54:27,932 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:54:27,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:54:28,261 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-03 02:54:28,443 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 02:54:28,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 02:54:28,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:28,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:54:28,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:28,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:29,286 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 02:54:29,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 57 [2022-11-03 02:54:29,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:29,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-03 02:54:29,324 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 14 treesize of output 18 [2022-11-03 02:54:30,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:30,362 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 02:54:30,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 85 [2022-11-03 02:54:30,436 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:54:30,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-03 02:54:30,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:30,528 INFO L356 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2022-11-03 02:54:30,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2022-11-03 02:54:30,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:31,784 INFO L356 Elim1Store]: treesize reduction 132, result has 12.0 percent of original size [2022-11-03 02:54:31,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 210 treesize of output 123 [2022-11-03 02:54:31,926 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-11-03 02:54:31,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 144 [2022-11-03 02:54:31,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-11-03 02:54:31,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-11-03 02:54:32,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-11-03 02:54:32,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-03 02:54:32,062 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 9 treesize of output 7 [2022-11-03 02:54:32,242 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:54:32,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2022-11-03 02:54:32,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:54:32,377 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-03 02:54:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:54:32,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:32,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_802)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_791) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_792) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:54:32,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_782 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_802)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_782) .cse0 v_ArrVal_791) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_792) .cse0 v_ArrVal_789) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_783) .cse0 v_ArrVal_787) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 02:54:33,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_782 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse3 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_802)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_782) .cse2 v_ArrVal_791) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_792) .cse2 v_ArrVal_789) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_783) .cse2 v_ArrVal_787) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-03 02:54:33,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| (_ BitVec 32)) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_782 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_811))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_812)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse4 .cse1)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse5 .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_813))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_802))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_782) .cse3 v_ArrVal_791) (select (select (store (store (store .cse4 .cse1 (store .cse5 .cse2 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_792) .cse3 v_ArrVal_789) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_783) .cse3 v_ArrVal_787) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)))))))))) is different from false [2022-11-03 02:54:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224897913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:33,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:54:33,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-11-03 02:54:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505891103] [2022-11-03 02:54:33,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:33,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:54:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:54:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2371, Unknown=9, NotChecked=404, Total=2970 [2022-11-03 02:54:33,366 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:54:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:36,057 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-11-03 02:54:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 02:54:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-11-03 02:54:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:36,060 INFO L225 Difference]: With dead ends: 56 [2022-11-03 02:54:36,060 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 02:54:36,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=213, Invalid=2874, Unknown=9, NotChecked=444, Total=3540 [2022-11-03 02:54:36,062 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:36,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 150 Unchecked, 1.9s Time] [2022-11-03 02:54:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 02:54:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-03 02:54:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:54:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-11-03 02:54:36,076 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 36 [2022-11-03 02:54:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:36,076 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-11-03 02:54:36,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:54:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-11-03 02:54:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:54:36,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:36,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:36,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 02:54:36,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:36,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-11-03 02:54:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:36,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2022-11-03 02:54:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:36,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902579058] [2022-11-03 02:54:36,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:36,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:36,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:36,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:54:36,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:54:36,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:37,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:54:37,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:37,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:37,693 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:37,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902579058] [2022-11-03 02:54:37,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902579058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [627448716] [2022-11-03 02:54:37,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:37,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:37,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-03 02:54:38,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:54:38,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:38,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:54:38,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:38,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:38,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [627448716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319953215] [2022-11-03 02:54:38,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:38,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:38,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:38,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:38,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:54:39,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:54:39,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:39,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:54:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:54:39,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:54:40,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319953215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:40,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:54:40,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6, 6] total 10 [2022-11-03 02:54:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259905457] [2022-11-03 02:54:40,710 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:40,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:54:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:54:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:54:40,712 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:54:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:40,826 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-11-03 02:54:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:54:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2022-11-03 02:54:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:40,828 INFO L225 Difference]: With dead ends: 71 [2022-11-03 02:54:40,828 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 02:54:40,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:54:40,829 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 168 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:40,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 154 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:54:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 02:54:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-03 02:54:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:54:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-03 02:54:40,842 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 37 [2022-11-03 02:54:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:40,842 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-03 02:54:40,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:54:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-03 02:54:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:54:40,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:40,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:40,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:41,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:41,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:41,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2022-11-03 02:54:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:41,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89711777] [2022-11-03 02:54:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:41,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:41,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:54:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:41,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:54:41,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:42,035 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-03 02:54:42,042 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-03 02:54:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:42,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:42,195 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89711777] [2022-11-03 02:54:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89711777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [667916481] [2022-11-03 02:54:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:42,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:42,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-03 02:54:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:43,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:54:43,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:43,200 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-03 02:54:43,204 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-03 02:54:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:43,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [667916481] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:43,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757535404] [2022-11-03 02:54:43,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:43,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:43,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:54:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:43,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:54:43,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:43,759 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-03 02:54:43,762 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-03 02:54:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:43,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:54:43,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757535404] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:43,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:54:43,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 7 [2022-11-03 02:54:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946040890] [2022-11-03 02:54:43,849 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:43,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:54:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:43,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:54:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:54:43,853 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:54:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:44,665 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-11-03 02:54:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:54:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-11-03 02:54:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:44,667 INFO L225 Difference]: With dead ends: 82 [2022-11-03 02:54:44,667 INFO L226 Difference]: Without dead ends: 67 [2022-11-03 02:54:44,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:54:44,669 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:44,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 164 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:54:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-03 02:54:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-11-03 02:54:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:54:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-03 02:54:44,690 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 38 [2022-11-03 02:54:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:44,690 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-03 02:54:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:54:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-03 02:54:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:54:44,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:44,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:44,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-11-03 02:54:44,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:45,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:45,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2022-11-03 02:54:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177348694] [2022-11-03 02:54:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:45,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:45,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:45,301 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:45,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 02:54:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:45,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:54:45,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:45,892 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:54:45,893 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:54:45,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 02:54:46,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:46,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 02:54:46,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 02:54:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:54:46,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:46,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:46,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177348694] [2022-11-03 02:54:46,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177348694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:46,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [301138184] [2022-11-03 02:54:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:46,455 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:46,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-03 02:54:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:47,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:54:47,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:47,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 02:54:47,764 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:54:47,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-03 02:54:47,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 02:54:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:54:47,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [301138184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30975185] [2022-11-03 02:54:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:48,067 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:48,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:54:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:48,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:54:48,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:48,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 02:54:48,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:48,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 02:54:48,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 02:54:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:54:48,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:48,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30975185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:48,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:54:48,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2022-11-03 02:54:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335462813] [2022-11-03 02:54:48,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:54:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:54:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=586, Unknown=20, NotChecked=0, Total=702 [2022-11-03 02:54:48,786 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:54:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:50,194 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-11-03 02:54:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:54:50,194 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-11-03 02:54:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:50,195 INFO L225 Difference]: With dead ends: 67 [2022-11-03 02:54:50,195 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 02:54:50,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=823, Unknown=22, NotChecked=0, Total=992 [2022-11-03 02:54:50,197 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:50,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 255 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 58 Unchecked, 1.2s Time] [2022-11-03 02:54:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 02:54:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-03 02:54:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:54:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-11-03 02:54:50,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2022-11-03 02:54:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:50,211 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-11-03 02:54:50,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:54:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-11-03 02:54:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:54:50,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:50,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:50,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:50,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-03 02:54:50,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:50,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:50,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:54:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2022-11-03 02:54:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:50,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001786365] [2022-11-03 02:54:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:50,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:50,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:50,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:50,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceb2237a-ebfd-4af8-980e-f62aa12d5399/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 02:54:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:51,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-03 02:54:51,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:51,396 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-03 02:54:51,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:54:51,544 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:54:51,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:54:51,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:54:51,858 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 02:54:51,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 02:54:52,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:52,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:54:52,511 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 02:54:52,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 40 [2022-11-03 02:54:52,909 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-03 02:54:52,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2022-11-03 02:54:52,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-03 02:54:52,928 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-03 02:54:53,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:53,314 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:54:53,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:54:53,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:54:53,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:53,390 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 02:54:53,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 70 [2022-11-03 02:54:53,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:53,453 INFO L356 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2022-11-03 02:54:53,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2022-11-03 02:54:54,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:54,997 INFO L356 Elim1Store]: treesize reduction 218, result has 10.3 percent of original size [2022-11-03 02:54:54,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 237 treesize of output 114 [2022-11-03 02:54:55,150 INFO L356 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-03 02:54:55,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 250 treesize of output 156 [2022-11-03 02:54:55,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:55,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2022-11-03 02:54:55,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:55,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-03 02:54:55,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:55,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:55,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2022-11-03 02:54:55,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2022-11-03 02:54:55,326 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 13 treesize of output 11 [2022-11-03 02:54:55,988 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-11-03 02:54:55,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 71 [2022-11-03 02:54:56,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-03 02:54:56,190 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-03 02:54:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:54:56,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:56,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2977 (_ BitVec 32)) (v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2981 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2996)) (.cse2 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2986))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2992))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_2977) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2981))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2978) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv8 32) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-11-03 02:54:57,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2977 (_ BitVec 32)) (v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2981 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2987) .cse2 v_ArrVal_2996)) (.cse3 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse2))) .cse2 v_ArrVal_2986))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2992))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_2977) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2981))) .cse2 v_ArrVal_2978) (select (select .cse3 .cse4) .cse5)) (bvadd (select (select .cse6 .cse4) .cse5) (_ bv8 32))))))))) is different from false [2022-11-03 02:54:57,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2977 (_ BitVec 32)) (v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2981 (_ BitVec 32))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse3 (select .cse9 .cse10))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2987) .cse3 v_ArrVal_2996)) (.cse4 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse2 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse3))) .cse3 v_ArrVal_2986))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse2 v_ArrVal_2992))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_2977) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_2981))) .cse3 v_ArrVal_2978) (select (select .cse4 .cse5) .cse6)) (bvadd (_ bv8 32) (select (select .cse7 .cse5) .cse6)))))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2022-11-03 02:54:58,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:54:58,336 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 689 treesize of output 682 [2022-11-03 02:54:58,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:54:58,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162624 treesize of output 156066 [2022-11-03 02:54:58,932 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 168984 treesize of output 161340 [2022-11-03 02:54:59,099 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 161340 treesize of output 139500