./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:58:01,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:58:01,800 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 20:58:01,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:58:01,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:58:01,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:58:01,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:58:01,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:58:01,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 20:58:01,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 20:58:01,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:58:01,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:58:01,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:58:01,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:58:01,878 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:58:01,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:58:01,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:58:01,879 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:58:01,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:58:01,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:58:01,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:58:01,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:58:01,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:58:01,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:58:01,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:58:01,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:58:01,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:58:01,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:58:01,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:58:01,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:58:01,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:58:01,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:58:01,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:58:01,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:58:01,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:58:01,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:58:01,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:58:01,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:58:01,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:58:01,888 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:58:01,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:58:01,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:58:01,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/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_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-21 20:58:02,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:58:02,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:58:02,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:58:02,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:58:02,209 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:58:02,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-21 20:58:05,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:58:06,099 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:58:06,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-21 20:58:06,123 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/data/f429e0149/56a4180791dd43c2829303ace756a57f/FLAG64332d210 [2023-11-21 20:58:06,143 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/data/f429e0149/56a4180791dd43c2829303ace756a57f [2023-11-21 20:58:06,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:58:06,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:58:06,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:58:06,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:58:06,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:58:06,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387534b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06, skipping insertion in model container [2023-11-21 20:58:06,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,220 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:58:06,625 WARN L240 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_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-21 20:58:06,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:58:06,652 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:58:06,753 WARN L240 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_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-21 20:58:06,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:58:06,805 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:58:06,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06 WrapperNode [2023-11-21 20:58:06,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:58:06,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:58:06,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:58:06,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:58:06,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,889 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-11-21 20:58:06,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:58:06,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:58:06,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:58:06,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:58:06,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,910 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,935 INFO L187 HeapSplitter]: Split 25 memory accesses to 3 slices as follows [2, 14, 9] [2023-11-21 20:58:06,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:58:06,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:58:06,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:58:06,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:58:06,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (1/1) ... [2023-11-21 20:58:06,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:58:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:58:07,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:58:07,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:58:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 20:58:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 20:58:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 20:58:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 20:58:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 20:58:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 20:58:07,066 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 20:58:07,066 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 20:58:07,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 20:58:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:58:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:58:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 20:58:07,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 20:58:07,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 20:58:07,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 20:58:07,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 20:58:07,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 20:58:07,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:58:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 20:58:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 20:58:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 20:58:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 20:58:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 20:58:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 20:58:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:58:07,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:58:07,237 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:58:07,240 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:58:07,605 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:58:07,792 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:58:07,793 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 20:58:07,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:58:07 BoogieIcfgContainer [2023-11-21 20:58:07,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:58:07,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:58:07,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:58:07,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:58:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:58:06" (1/3) ... [2023-11-21 20:58:07,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379f45a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:58:07, skipping insertion in model container [2023-11-21 20:58:07,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:58:06" (2/3) ... [2023-11-21 20:58:07,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379f45a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:58:07, skipping insertion in model container [2023-11-21 20:58:07,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:58:07" (3/3) ... [2023-11-21 20:58:07,807 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-21 20:58:07,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:58:07,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 20:58:07,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:58:07,905 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2fe14c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:58:07,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 20:58:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 20:58:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 20:58:07,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:07,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:07,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:07,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash -328306301, now seen corresponding path program 1 times [2023-11-21 20:58:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074950222] [2023-11-21 20:58:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:58:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074950222] [2023-11-21 20:58:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074950222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:58:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:58:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:58:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984965059] [2023-11-21 20:58:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:58:08,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:58:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:58:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:58:08,783 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.5) 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) [2023-11-21 20:58:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:58:09,113 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2023-11-21 20:58:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:58:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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 [2023-11-21 20:58:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:58:09,126 INFO L225 Difference]: With dead ends: 45 [2023-11-21 20:58:09,127 INFO L226 Difference]: Without dead ends: 21 [2023-11-21 20:58:09,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:58:09,139 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 20:58:09,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 20:58:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-21 20:58:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-21 20:58:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2023-11-21 20:58:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-21 20:58:09,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2023-11-21 20:58:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:58:09,206 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-21 20:58:09,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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) [2023-11-21 20:58:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-21 20:58:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 20:58:09,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:09,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:09,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:58:09,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:09,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1024789413, now seen corresponding path program 1 times [2023-11-21 20:58:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672497818] [2023-11-21 20:58:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:58:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:58:09,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:09,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672497818] [2023-11-21 20:58:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672497818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:58:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:58:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:58:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842599306] [2023-11-21 20:58:09,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:58:09,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:58:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:58:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:58:09,880 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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) [2023-11-21 20:58:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:58:10,257 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-21 20:58:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:58:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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 [2023-11-21 20:58:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:58:10,260 INFO L225 Difference]: With dead ends: 26 [2023-11-21 20:58:10,260 INFO L226 Difference]: Without dead ends: 20 [2023-11-21 20:58:10,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:58:10,263 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 20:58:10,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 20:58:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-21 20:58:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-21 20:58:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2023-11-21 20:58:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-21 20:58:10,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-21 20:58:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:58:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-21 20:58:10,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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) [2023-11-21 20:58:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-21 20:58:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 20:58:10,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:10,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:10,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:58:10,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:10,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1792809609, now seen corresponding path program 1 times [2023-11-21 20:58:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593333626] [2023-11-21 20:58:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:58:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:58:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593333626] [2023-11-21 20:58:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593333626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800375955] [2023-11-21 20:58:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:58:13,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:58:13,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 20:58:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:15,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-21 20:58:15,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:58:15,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 20:58:15,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:58:15,521 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 20:58:15,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 20:58:15,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 20:58:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-21 20:58:16,282 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 20:58:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-21 20:58:16,324 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-21 20:58:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-21 20:58:16,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 61 [2023-11-21 20:58:16,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-21 20:58:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:16,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:16,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 20:58:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:58:16,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:58:17,320 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2023-11-21 20:58:17,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 231 treesize of output 324 [2023-11-21 20:58:17,448 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2023-11-21 20:58:17,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 212 treesize of output 305 [2023-11-21 20:58:17,820 INFO L349 Elim1Store]: treesize reduction 130, result has 23.1 percent of original size [2023-11-21 20:58:17,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 232 [2023-11-21 20:58:17,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:17,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2023-11-21 20:58:17,935 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 20:58:17,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2023-11-21 20:58:18,513 INFO L349 Elim1Store]: treesize reduction 387, result has 34.3 percent of original size [2023-11-21 20:58:18,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 399 treesize of output 821 [2023-11-21 20:58:19,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:19,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:19,415 INFO L349 Elim1Store]: treesize reduction 129, result has 8.5 percent of original size [2023-11-21 20:58:19,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 563 treesize of output 538 [2023-11-21 20:58:23,540 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-21 20:58:23,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12861 treesize of output 11999 [2023-11-21 20:58:26,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (and (or (and .cse0 .cse1) (forall ((v_ArrVal_443 Int) (v_DerPreprocessor_29 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (not .cse0) (not .cse1) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse2 (= .cse5 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (not .cse2) (not .cse3) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_32) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (and .cse2 .cse3) (let ((.cse4 (= .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or .cse4 (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_34) .cse5 v_DerPreprocessor_35) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse5 v_DerPreprocessor_33) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse4))))))))))) is different from false [2023-11-21 20:58:26,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800375955] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:26,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 20:58:26,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2023-11-21 20:58:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898036463] [2023-11-21 20:58:26,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 20:58:26,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-21 20:58:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-21 20:58:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1495, Unknown=32, NotChecked=78, Total=1722 [2023-11-21 20:58:26,651 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:58:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:58:28,689 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-21 20:58:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 20:58:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2023-11-21 20:58:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:58:28,691 INFO L225 Difference]: With dead ends: 27 [2023-11-21 20:58:28,691 INFO L226 Difference]: Without dead ends: 25 [2023-11-21 20:58:28,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=192, Invalid=2229, Unknown=33, NotChecked=96, Total=2550 [2023-11-21 20:58:28,694 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-21 20:58:28,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-21 20:58:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-21 20:58:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-21 20:58:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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) [2023-11-21 20:58:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-21 20:58:28,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 23 [2023-11-21 20:58:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:58:28,704 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-21 20:58:28,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:58:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-21 20:58:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 20:58:28,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:28,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:28,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-21 20:58:28,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:28,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:28,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 168368091, now seen corresponding path program 2 times [2023-11-21 20:58:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919478979] [2023-11-21 20:58:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:58:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:58:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:29,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919478979] [2023-11-21 20:58:29,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919478979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:58:29,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:58:29,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 20:58:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45881268] [2023-11-21 20:58:29,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:58:29,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:58:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:58:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:58:29,229 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-11-21 20:58:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:58:29,449 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2023-11-21 20:58:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:58:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 24 [2023-11-21 20:58:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:58:29,455 INFO L225 Difference]: With dead ends: 29 [2023-11-21 20:58:29,455 INFO L226 Difference]: Without dead ends: 22 [2023-11-21 20:58:29,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:58:29,456 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:58:29,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:58:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-21 20:58:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-21 20:58:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2023-11-21 20:58:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-21 20:58:29,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2023-11-21 20:58:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:58:29,464 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-21 20:58:29,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-11-21 20:58:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-21 20:58:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 20:58:29,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:29,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:29,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:58:29,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:29,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -606270385, now seen corresponding path program 1 times [2023-11-21 20:58:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105688197] [2023-11-21 20:58:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:58:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:58:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105688197] [2023-11-21 20:58:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105688197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332090801] [2023-11-21 20:58:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:30,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:58:30,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:58:30,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 20:58:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:30,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-21 20:58:30,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:58:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 20:58:30,955 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 20:58:30,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 20:58:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:58:31,087 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-21 20:58:31,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2023-11-21 20:58:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:31,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-21 20:58:31,381 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-21 20:58:31,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 20:58:31,651 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-11-21 20:58:31,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 55 [2023-11-21 20:58:31,668 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-21 20:58:31,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 107 [2023-11-21 20:58:31,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:31,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:31,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-21 20:58:31,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-11-21 20:58:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 20:58:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:58:31,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:58:32,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 278 [2023-11-21 20:58:32,112 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2023-11-21 20:58:32,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 222 treesize of output 315 [2023-11-21 20:58:32,300 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-21 20:58:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 57 [2023-11-21 20:58:32,309 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 20:58:32,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 26 [2023-11-21 20:58:32,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:32,400 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-21 20:58:32,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 80 [2023-11-21 20:58:32,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:32,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 38 [2023-11-21 20:58:32,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,449 INFO L349 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2023-11-21 20:58:32,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 80 [2023-11-21 20:58:32,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,461 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 20:58:32,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2023-11-21 20:58:32,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:32,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 20:58:32,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2023-11-21 20:58:32,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,481 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:58:32,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:32,485 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-21 20:58:32,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (= .cse2 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (and (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_51) .cse2 v_DerPreprocessor_52))) (or (not (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_51))))) (or (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (not (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_53) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (and .cse4 .cse5)) (or (not .cse4) (forall ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (not (let ((.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_50) .cse6) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse6)))) (not .cse5))))) (not .cse7)) (forall ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse8 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_47) .cse9) .cse10) .cse9)))) (or .cse7 (forall ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse8 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_46) .cse9) .cse10) .cse9)))))) is different from false [2023-11-21 20:58:32,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0))) (and (forall ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_47) .cse1) .cse2) .cse1)))) (or .cse3 (forall ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_46) .cse1) .cse2) .cse1)))) (or (not .cse3) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse8 (= .cse6 0)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (and (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_51) .cse6 v_DerPreprocessor_52))) (or (not (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse4 .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5))) (not (= (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_51))))) (or (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (not (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_53) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (and .cse8 .cse9)) (or (not .cse8) (forall ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (not (let ((.cse10 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_50) .cse10) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse10)))) (not .cse9)))))))) is different from false [2023-11-21 20:58:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332090801] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:33,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 20:58:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2023-11-21 20:58:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991982117] [2023-11-21 20:58:33,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 20:58:33,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-21 20:58:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-21 20:58:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=8, NotChecked=134, Total=1332 [2023-11-21 20:58:33,403 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 20:58:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:58:35,324 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-21 20:58:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 20:58:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-21 20:58:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:58:35,327 INFO L225 Difference]: With dead ends: 35 [2023-11-21 20:58:35,327 INFO L226 Difference]: Without dead ends: 32 [2023-11-21 20:58:35,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=8, NotChecked=174, Total=2162 [2023-11-21 20:58:35,329 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-21 20:58:35,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 193 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-21 20:58:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-21 20:58:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2023-11-21 20:58:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2023-11-21 20:58:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-21 20:58:35,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 25 [2023-11-21 20:58:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:58:35,339 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-21 20:58:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 20:58:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-11-21 20:58:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 20:58:35,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:58:35,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:35,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:58:35,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:35,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:58:35,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1614471581, now seen corresponding path program 1 times [2023-11-21 20:58:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524729476] [2023-11-21 20:58:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:58:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:58:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:58:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:58:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524729476] [2023-11-21 20:58:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524729476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212501124] [2023-11-21 20:58:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:38,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:58:38,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:58:38,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d1ca5f5-f76a-4472-8caa-3c7a8715a503/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 20:58:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:39,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-21 20:58:39,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:58:39,220 INFO L378 Elim1Store]: Elim1 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 [2023-11-21 20:58:39,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:58:39,666 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 20:58:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 20:58:40,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 65 [2023-11-21 20:58:40,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:58:40,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-11-21 20:58:40,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-21 20:58:40,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:58:40,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2023-11-21 20:58:40,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-21 20:58:40,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-11-21 20:58:40,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 20:58:40,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 20:58:40,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 20:58:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:58:40,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:58:40,668 INFO L349 Elim1Store]: treesize reduction 75, result has 40.9 percent of original size [2023-11-21 20:58:40,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 241 treesize of output 335 [2023-11-21 20:58:40,806 INFO L349 Elim1Store]: treesize reduction 75, result has 40.9 percent of original size [2023-11-21 20:58:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 220 treesize of output 314 [2023-11-21 20:58:41,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:41,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 558 treesize of output 546 [2023-11-21 20:58:42,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:42,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 158 [2023-11-21 20:58:42,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:42,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 87 [2023-11-21 20:58:42,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:42,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 153 [2023-11-21 20:58:42,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:58:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 87