./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:33:09,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:33:09,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:33:09,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:33:09,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:33:09,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:33:09,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:33:09,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:33:09,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:33:09,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:33:09,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:33:09,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:33:09,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:33:09,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:33:09,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:33:09,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:33:09,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:33:09,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:33:09,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:33:09,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:33:09,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:33:09,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:33:09,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:33:09,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:33:09,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:33:09,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:33:09,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:33:09,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:33:09,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:33:09,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:33:09,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:33:09,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:33:09,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:33:09,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:33:09,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:33:09,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:33:09,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:33:09,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:33:09,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:33:09,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:33:09,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:33:09,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:33:09,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:33:09,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:33:09,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:33:09,985 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:33:09,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:33:09,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:33:09,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:33:09,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:33:09,988 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:33:09,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:33:09,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:33:09,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:33:09,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:33:09,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:33:09,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:33:09,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:33:09,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:33:09,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:33:09,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:33:09,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:33:09,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:33:09,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:33:09,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:33:09,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:33:09,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:33:09,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:33:09,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:33:09,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:33:09,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:33:09,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:33:09,995 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:33:09,995 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:33:09,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:33:09,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/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_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-20 12:33:10,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:33:10,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:33:10,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:33:10,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:33:10,343 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:33:10,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-20 12:33:13,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:33:13,847 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:33:13,847 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-20 12:33:13,860 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/data/513035d67/baa853bfdbec4fc08d8a2ffcfa084b1e/FLAGb6fdac683 [2022-11-20 12:33:13,877 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/data/513035d67/baa853bfdbec4fc08d8a2ffcfa084b1e [2022-11-20 12:33:13,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:33:13,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:33:13,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:33:13,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:33:13,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:33:13,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:33:13" (1/1) ... [2022-11-20 12:33:13,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d3d471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:13, skipping insertion in model container [2022-11-20 12:33:13,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:33:13" (1/1) ... [2022-11-20 12:33:13,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:33:13,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:33:14,353 WARN L237 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_94b98016-7eca-4a63-b582-93c5c1492d5a/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-20 12:33:14,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:33:14,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:33:14,449 WARN L237 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_94b98016-7eca-4a63-b582-93c5c1492d5a/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-20 12:33:14,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:33:14,486 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:33:14,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14 WrapperNode [2022-11-20 12:33:14,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:33:14,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:33:14,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:33:14,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:33:14,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,584 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-11-20 12:33:14,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:33:14,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:33:14,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:33:14,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:33:14,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:33:14,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:33:14,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:33:14,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:33:14,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (1/1) ... [2022-11-20 12:33:14,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:33:14,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:14,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:33:14,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:33:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:33:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:33:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 12:33:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 12:33:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:33:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:33:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:33:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:33:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:33:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:33:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:33:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:33:14,949 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:33:14,952 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:33:15,195 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:33:15,202 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:33:15,202 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 12:33:15,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:33:15 BoogieIcfgContainer [2022-11-20 12:33:15,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:33:15,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:33:15,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:33:15,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:33:15,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:33:13" (1/3) ... [2022-11-20 12:33:15,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1591c4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:33:15, skipping insertion in model container [2022-11-20 12:33:15,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:33:14" (2/3) ... [2022-11-20 12:33:15,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1591c4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:33:15, skipping insertion in model container [2022-11-20 12:33:15,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:33:15" (3/3) ... [2022-11-20 12:33:15,216 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-20 12:33:15,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:33:15,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:33:15,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:33:15,328 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45138723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:33:15,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:33:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:33:15,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:15,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:15,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-11-20 12:33:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171141787] [2022-11-20 12:33:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:15,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:33:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171141787] [2022-11-20 12:33:15,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171141787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:15,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:15,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:33:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880044699] [2022-11-20 12:33:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:15,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:33:15,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:33:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:33:15,819 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:33:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:15,920 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-11-20 12:33:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:33:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-20 12:33:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:15,937 INFO L225 Difference]: With dead ends: 63 [2022-11-20 12:33:15,937 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 12:33:15,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:33:15,946 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:15,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 12:33:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 12:33:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-20 12:33:16,005 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-11-20 12:33:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:16,008 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-20 12:33:16,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:33:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-20 12:33:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:33:16,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:16,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:16,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:33:16,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-11-20 12:33:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:16,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555860103] [2022-11-20 12:33:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:33:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555860103] [2022-11-20 12:33:16,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555860103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:16,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:16,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:33:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763178458] [2022-11-20 12:33:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:16,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:33:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:33:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:33:16,393 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:33:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:16,484 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-20 12:33:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:33:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-20 12:33:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:16,489 INFO L225 Difference]: With dead ends: 51 [2022-11-20 12:33:16,489 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 12:33:16,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:33:16,494 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:16,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 12:33:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-11-20 12:33:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-20 12:33:16,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-20 12:33:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:16,513 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-20 12:33:16,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:33:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-20 12:33:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 12:33:16,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:16,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:16,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:33:16,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-11-20 12:33:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126244019] [2022-11-20 12:33:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 12:33:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:16,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126244019] [2022-11-20 12:33:16,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126244019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:16,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:16,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:33:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270531028] [2022-11-20 12:33:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:16,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:33:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:33:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:33:16,933 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:17,017 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-20 12:33:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:33:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 12:33:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:17,020 INFO L225 Difference]: With dead ends: 53 [2022-11-20 12:33:17,020 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 12:33:17,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:33:17,022 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:17,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 12:33:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-11-20 12:33:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-20 12:33:17,033 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-11-20 12:33:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:17,034 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-20 12:33:17,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-20 12:33:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 12:33:17,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:17,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:17,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:33:17,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-11-20 12:33:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:17,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17981716] [2022-11-20 12:33:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 12:33:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:17,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17981716] [2022-11-20 12:33:17,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17981716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:17,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:17,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:33:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421399818] [2022-11-20 12:33:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:17,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:33:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:33:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:33:17,323 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:17,412 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-11-20 12:33:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:33:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-20 12:33:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:17,414 INFO L225 Difference]: With dead ends: 59 [2022-11-20 12:33:17,414 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 12:33:17,415 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 [2022-11-20 12:33:17,416 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:17,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 12:33:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-20 12:33:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-20 12:33:17,426 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-11-20 12:33:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-20 12:33:17,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-20 12:33:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 12:33:17,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:17,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:17,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:33:17,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-11-20 12:33:17,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:17,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858108605] [2022-11-20 12:33:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:33:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:17,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858108605] [2022-11-20 12:33:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858108605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983491726] [2022-11-20 12:33:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:17,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:17,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:17,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:17,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:33:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:18,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:33:18,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:33:18,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:33:18,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983491726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:18,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:18,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-20 12:33:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382074480] [2022-11-20 12:33:18,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:18,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:33:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:33:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:33:18,307 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:18,405 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-20 12:33:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:33:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-20 12:33:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:18,407 INFO L225 Difference]: With dead ends: 56 [2022-11-20 12:33:18,407 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 12:33:18,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:33:18,409 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 98 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:18,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 123 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 12:33:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-11-20 12:33:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-20 12:33:18,419 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-11-20 12:33:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:18,420 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-20 12:33:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-20 12:33:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 12:33:18,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:18,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:18,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:18,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:18,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-11-20 12:33:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:18,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079587218] [2022-11-20 12:33:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:18,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:33:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079587218] [2022-11-20 12:33:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079587218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:18,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:18,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:33:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128904275] [2022-11-20 12:33:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:18,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:33:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:33:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:33:18,845 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:18,940 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-11-20 12:33:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:33:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-20 12:33:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:18,947 INFO L225 Difference]: With dead ends: 55 [2022-11-20 12:33:18,947 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 12:33:18,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:33:18,956 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:18,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 12:33:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-11-20 12:33:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:33:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-20 12:33:18,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-11-20 12:33:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:18,977 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-20 12:33:18,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-20 12:33:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:33:18,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:18,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:18,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:33:18,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-11-20 12:33:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:18,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876330396] [2022-11-20 12:33:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:33:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876330396] [2022-11-20 12:33:22,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876330396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389573109] [2022-11-20 12:33:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:22,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:22,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:22,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:22,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:33:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:22,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-20 12:33:22,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:22,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:33:22,852 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:33:22,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:33:22,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:33:23,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:33:23,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 12:33:23,249 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-20 12:33:23,250 INFO L350 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 100 [2022-11-20 12:33:23,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-11-20 12:33:23,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-11-20 12:33:23,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 12:33:23,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-11-20 12:33:23,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 12:33:23,755 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:33:23,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-11-20 12:33:23,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-20 12:33:23,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:23,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-20 12:33:24,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:24,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-20 12:33:24,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:33:24,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:24,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-20 12:33:24,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-20 12:33:24,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 12:33:24,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 12:33:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:33:24,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:25,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_745 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= .cse0 (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_745) (select (store .cse1 .cse2 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store .cse3 .cse2 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_745 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_745) (select (store .cse1 .cse4 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store .cse3 .cse4 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse0)))))) is different from false [2022-11-20 12:33:25,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:25,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 12:33:25,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:25,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 12:33:25,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-20 12:33:25,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:25,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 12:33:25,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:25,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 12:33:25,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-20 12:33:25,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-20 12:33:26,076 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-20 12:33:26,149 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_741) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-20 12:33:26,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_741) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)))))) is different from false [2022-11-20 12:33:26,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:26,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 12:33:26,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:26,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-11-20 12:33:26,275 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_738)) .cse2 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_738)) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_742)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_737 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-20 12:33:26,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_738)) .cse2 v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int)) (or (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (not (= (select (store (select (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 .cse1 v_ArrVal_738)) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_742)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_737 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-20 12:33:26,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:26,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 12:33:26,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-11-20 12:33:26,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 12:33:26,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 12:33:26,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 12:33:26,773 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:33:26,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-11-20 12:33:26,784 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:33:26,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2022-11-20 12:33:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-20 12:33:27,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389573109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:27,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:27,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 68 [2022-11-20 12:33:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430188227] [2022-11-20 12:33:27,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:27,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-20 12:33:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-20 12:33:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3431, Unknown=34, NotChecked=868, Total=4556 [2022-11-20 12:33:27,339 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 12:33:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:31,036 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-11-20 12:33:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:33:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-11-20 12:33:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:31,040 INFO L225 Difference]: With dead ends: 94 [2022-11-20 12:33:31,040 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 12:33:31,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=392, Invalid=5150, Unknown=36, NotChecked=1064, Total=6642 [2022-11-20 12:33:31,044 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 178 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:31,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 785 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1238 Invalid, 0 Unknown, 526 Unchecked, 1.3s Time] [2022-11-20 12:33:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 12:33:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2022-11-20 12:33:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-11-20 12:33:31,061 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 42 [2022-11-20 12:33:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:31,062 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2022-11-20 12:33:31,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 59 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 12:33:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-11-20 12:33:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:33:31,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:31,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:31,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:31,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2022-11-20 12:33:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:31,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915914847] [2022-11-20 12:33:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:33:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:31,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915914847] [2022-11-20 12:33:31,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915914847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:31,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:31,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:33:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238915145] [2022-11-20 12:33:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:31,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:33:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:31,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:33:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:33:31,503 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:31,603 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-11-20 12:33:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:33:31,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-20 12:33:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:31,607 INFO L225 Difference]: With dead ends: 75 [2022-11-20 12:33:31,608 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 12:33:31,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:33:31,610 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:31,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 12:33:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 12:33:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-11-20 12:33:31,638 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 43 [2022-11-20 12:33:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:31,638 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-11-20 12:33:31,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-11-20 12:33:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:33:31,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:31,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:31,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:33:31,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2022-11-20 12:33:31,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:31,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808636435] [2022-11-20 12:33:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:33:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808636435] [2022-11-20 12:33:31,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808636435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028322343] [2022-11-20 12:33:31,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:33:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:31,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:31,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:33:33,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 12:33:33,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:33,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:33:33,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:33:33,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:33:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028322343] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:33,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:33:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2022-11-20 12:33:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463612691] [2022-11-20 12:33:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:33:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:33:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:33:33,670 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:33,731 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-11-20 12:33:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:33:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-20 12:33:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:33,733 INFO L225 Difference]: With dead ends: 84 [2022-11-20 12:33:33,733 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 12:33:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:33:33,737 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:33,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:33:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 12:33:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-11-20 12:33:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-11-20 12:33:33,758 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 43 [2022-11-20 12:33:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:33,758 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-11-20 12:33:33,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-11-20 12:33:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:33:33,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:33,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:33,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:33,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:33,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2022-11-20 12:33:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761652149] [2022-11-20 12:33:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:33:34,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:34,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761652149] [2022-11-20 12:33:34,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761652149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:34,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491999705] [2022-11-20 12:33:34,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:33:34,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:34,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:34,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:34,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:33:34,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:33:34,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:34,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:33:34,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:33:34,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:33:34,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491999705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:34,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:33:34,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-11-20 12:33:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935968316] [2022-11-20 12:33:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:34,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:33:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:33:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:33:34,466 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:34,537 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-11-20 12:33:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:33:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-20 12:33:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:34,539 INFO L225 Difference]: With dead ends: 89 [2022-11-20 12:33:34,539 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 12:33:34,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:33:34,541 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:34,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:33:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 12:33:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 12:33:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-20 12:33:34,560 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 43 [2022-11-20 12:33:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:34,561 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-20 12:33:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:33:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-20 12:33:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:33:34,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:34,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:34,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:34,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:33:34,775 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2022-11-20 12:33:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:34,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186365764] [2022-11-20 12:33:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:33:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186365764] [2022-11-20 12:33:35,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186365764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:35,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786700794] [2022-11-20 12:33:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:35,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:35,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:35,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:35,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:33:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:36,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-20 12:33:36,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:36,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 12:33:36,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 12:33:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:33:36,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:37,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-20 12:33:37,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:37,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:33:37,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786700794] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:37,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:37,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 11] total 36 [2022-11-20 12:33:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585277494] [2022-11-20 12:33:37,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:37,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 12:33:37,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:37,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 12:33:37,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 12:33:37,198 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 12:33:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:38,853 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-11-20 12:33:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 12:33:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-11-20 12:33:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:38,861 INFO L225 Difference]: With dead ends: 94 [2022-11-20 12:33:38,861 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 12:33:38,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 12:33:38,865 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 343 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:38,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 520 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:33:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 12:33:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2022-11-20 12:33:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-20 12:33:38,899 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 48 [2022-11-20 12:33:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:38,900 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-20 12:33:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 12:33:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-20 12:33:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:33:38,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:38,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:38,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 12:33:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:39,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 58122200, now seen corresponding path program 5 times [2022-11-20 12:33:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:39,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173814813] [2022-11-20 12:33:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:33:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:39,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173814813] [2022-11-20 12:33:39,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173814813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:39,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390539063] [2022-11-20 12:33:39,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:33:39,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:39,284 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:39,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:33:39,524 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-20 12:33:39,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:39,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:33:39,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:33:39,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:33:39,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390539063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:39,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:39,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-20 12:33:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739833570] [2022-11-20 12:33:39,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:33:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:39,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:33:39,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:33:39,701 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:39,933 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2022-11-20 12:33:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:33:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-20 12:33:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:39,935 INFO L225 Difference]: With dead ends: 112 [2022-11-20 12:33:39,935 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 12:33:39,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:33:39,937 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 113 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:39,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 12:33:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-11-20 12:33:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-20 12:33:39,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 48 [2022-11-20 12:33:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:39,963 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-20 12:33:39,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-20 12:33:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 12:33:39,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:39,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:39,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:40,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:40,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2022-11-20 12:33:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:40,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130119693] [2022-11-20 12:33:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 12:33:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130119693] [2022-11-20 12:33:40,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130119693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:40,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118618899] [2022-11-20 12:33:40,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:33:40,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:40,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:40,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:33:40,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:33:40,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:40,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:33:40,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 12:33:40,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 12:33:40,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118618899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:40,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:40,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-11-20 12:33:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449250792] [2022-11-20 12:33:40,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:40,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:33:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:33:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:33:40,916 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:41,030 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-20 12:33:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:33:41,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-11-20 12:33:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:41,032 INFO L225 Difference]: With dead ends: 73 [2022-11-20 12:33:41,032 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 12:33:41,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:33:41,034 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:41,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:33:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 12:33:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-20 12:33:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:33:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-20 12:33:41,046 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 49 [2022-11-20 12:33:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:41,047 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-20 12:33:41,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:33:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-20 12:33:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:33:41,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:33:41,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:33:41,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 12:33:41,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 12:33:41,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:33:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 6 times [2022-11-20 12:33:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:41,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928078698] [2022-11-20 12:33:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:41,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:33:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:33:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:33:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 12:33:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928078698] [2022-11-20 12:33:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928078698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200350010] [2022-11-20 12:33:41,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:33:41,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:41,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:41,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:33:42,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 12:33:42,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:42,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:33:42,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:33:42,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:33:42,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200350010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:42,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:33:42,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 12:33:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693305402] [2022-11-20 12:33:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:42,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:33:42,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:33:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:33:42,217 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 12:33:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:33:42,229 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-11-20 12:33:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:33:42,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-20 12:33:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:33:42,230 INFO L225 Difference]: With dead ends: 48 [2022-11-20 12:33:42,230 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:33:42,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:33:42,231 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:33:42,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:33:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:33:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:33:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:33:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:33:42,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-20 12:33:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:33:42,234 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:33:42,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 12:33:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:33:42,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:33:42,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:33:42,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:33:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:33:42,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:33:44,215 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-11-20 12:33:44,215 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2022-11-20 12:33:44,215 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-20 12:33:44,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:33:44,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:33:44,216 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-11-20 12:33:44,216 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse13 (select (select |#memory_int| .cse14) 8)) (.cse12 (+ |ULTIMATE.start_main_~len~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse11 (not (= .cse14 |ULTIMATE.start_main_~s~0#1.base|))) (.cse2 (<= .cse13 .cse12)) (.cse3 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse5 (<= .cse12 .cse13)) (.cse6 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8))) (and .cse0 (<= .cse1 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse2 .cse3 (<= |ULTIMATE.start_main_~len~0#1| .cse1) .cse4 .cse5 .cse6 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (* |ULTIMATE.start_main_~len~0#1| 2)) .cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse8 .cse9 .cse10)) (and .cse0 .cse11 (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) [2022-11-20 12:33:44,216 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-11-20 12:33:44,217 INFO L895 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= 0 .cse0) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_748 Int) (v_ArrVal_741 (Array Int Int))) (= (select (store (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 8) v_ArrVal_748) |ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) [2022-11-20 12:33:44,217 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-11-20 12:33:44,217 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-11-20 12:33:44,217 INFO L895 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse11 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse8 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse9 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse4 (* |ULTIMATE.start_main_~len~0#1| 2))) (and .cse0 .cse1 (= .cse2 3) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= 3 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse3 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse4) .cse5 .cse6 .cse7 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse8) .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse4 (+ 2 (select .cse11 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse12)) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (select .cse11 8) .cse8) .cse3 (= .cse8 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse5 .cse6 .cse7 (= .cse2 2) .cse9 .cse10 .cse12))) [2022-11-20 12:33:44,217 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-20 12:33:44,218 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:33:44,218 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-20 12:33:44,218 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-11-20 12:33:44,218 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse11 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse4 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse11)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse1 (select .cse10 8))) (and .cse0 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) .cse1) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= .cse1 |ULTIMATE.start_main_~len~0#1|) .cse2 (<= |ULTIMATE.start_main_~len~0#1| .cse1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (and .cse0 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse11 (+ 2 (select .cse10 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse9)))) [2022-11-20 12:33:44,218 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-11-20 12:33:44,219 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-11-20 12:33:44,219 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-11-20 12:33:44,219 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2022-11-20 12:33:44,219 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-20 12:33:44,219 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-20 12:33:44,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:33:44,220 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse1 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse6 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse4 (select .cse13 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (<= .cse2 (select (select |#memory_int| .cse3) 8)) (not (= .cse4 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (<= (select (select |#memory_int| .cse4) 8) .cse2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|) 0))) (and (= (select .cse12 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) .cse1 (= |ULTIMATE.start_dll_circular_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse14 (not (= (select .cse13 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse14 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse3 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (not .cse8) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) [2022-11-20 12:33:44,220 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-11-20 12:33:44,220 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-11-20 12:33:44,220 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-20 12:33:44,220 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-11-20 12:33:44,221 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) .cse1 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse2)) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2))) [2022-11-20 12:33:44,221 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-11-20 12:33:44,221 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse22 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse14 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse15 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse16 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse18 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse22)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse19 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse3)) (.cse10 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse21 (= .cse22 (+ 2 (select .cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 8))))) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select .cse2 8) .cse3) .cse4 .cse5 (= .cse3 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse6 .cse7 .cse8 (= .cse9 2) .cse10 .cse11 .cse12) (let ((.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)) (.cse17 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0))) (and (<= 1 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse0 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= 0 (select .cse13 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) .cse14 .cse15 .cse16 (= 3 (select (select |#memory_int| .cse17) (+ 8 (select .cse13 0)))) .cse5 .cse18 .cse6 .cse7 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse17)) .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse12)) (and .cse0 .cse1 (= .cse9 3) .cse14 .cse15 .cse16 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse12)))) [2022-11-20 12:33:44,222 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-11-20 12:33:44,222 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-20 12:33:44,222 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-11-20 12:33:44,222 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-20 12:33:44,222 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-11-20 12:33:44,223 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-11-20 12:33:44,223 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-20 12:33:44,226 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2022-11-20 12:33:44,229 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:33:44,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-11-20 12:33:44,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-11-20 12:33:44,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-11-20 12:33:44,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-11-20 12:33:44,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,262 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,262 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:33:44 BoogieIcfgContainer [2022-11-20 12:33:44,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:33:44,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:33:44,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:33:44,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:33:44,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:33:15" (3/4) ... [2022-11-20 12:33:44,299 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:33:44,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-20 12:33:44,311 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-20 12:33:44,312 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 12:33:44,312 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:33:44,312 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:33:44,343 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && 0 == #memory_$Pointer$[\result][\result]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: #memory_$Pointer$[#memory_$Pointer$[\result][\result] := v_ArrVal_741][\result][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][\result] == #memory_$Pointer$[\result][\result]) || v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < \result)) && \result == 0) && new_head == 0) && !(head == last) [2022-11-20 12:33:44,344 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && unknown-#memory_int-unknown[s][8] <= len) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && len <= unknown-#memory_int-unknown[s][8]) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || (((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && i == 1) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && s == 0)) || (((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && 0 <= i) && index <= 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) [2022-11-20 12:33:44,344 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((head == 0 && 2 + i <= unknown-#memory_int-unknown[s][8]) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || ((((((((((((head == 0 && s == head) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) [2022-11-20 12:33:44,344 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && head == 0) && i == 0) && i <= index) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || (((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && index == i) && s == head) && i == 1) && !(#memory_$Pointer$[head][head] == s)) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0)) || ((((((((((((head == 0 && head == 0) && i == 1) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && i <= index + 1) && !(head == s)) && index <= 0) && len + i == data) && len == 2) && \result == 0) && new_head == 0) && s == 0) [2022-11-20 12:33:44,345 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((head == 0 && head == 0) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && 0 <= i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((1 <= index && head == 0) && index <= 1) && 0 == #memory_$Pointer$[head][head]) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && 3 == unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][8 + #memory_$Pointer$[head][0]]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && !(head == #memory_$Pointer$[head][0])) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0)) || (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) [2022-11-20 12:33:44,345 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == \result) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) || (((((((((((((((head == 0 && head == 0) && i == 0) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) [2022-11-20 12:33:44,360 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:33:44,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:33:44,361 INFO L158 Benchmark]: Toolchain (without parser) took 30479.37ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 101.4MB in the beginning and 100.0MB in the end (delta: 1.4MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,362 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:33:44,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.76ms. Allocated memory is still 132.1MB. Free memory was 101.4MB in the beginning and 83.9MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.10ms. Allocated memory is still 132.1MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,363 INFO L158 Benchmark]: Boogie Preprocessor took 33.37ms. Allocated memory is still 132.1MB. Free memory was 81.8MB in the beginning and 80.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:33:44,363 INFO L158 Benchmark]: RCFGBuilder took 586.13ms. Allocated memory is still 132.1MB. Free memory was 80.0MB in the beginning and 64.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,363 INFO L158 Benchmark]: TraceAbstraction took 29085.74ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 63.5MB in the beginning and 103.1MB in the end (delta: -39.7MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,364 INFO L158 Benchmark]: Witness Printer took 66.35ms. Allocated memory is still 281.0MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:33:44,366 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.76ms. Allocated memory is still 132.1MB. Free memory was 101.4MB in the beginning and 83.9MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.10ms. Allocated memory is still 132.1MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.37ms. Allocated memory is still 132.1MB. Free memory was 81.8MB in the beginning and 80.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 586.13ms. Allocated memory is still 132.1MB. Free memory was 80.0MB in the beginning and 64.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29085.74ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 63.5MB in the beginning and 103.1MB in the end (delta: -39.7MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Witness Printer took 66.35ms. Allocated memory is still 281.0MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1014 mSDsluCounter, 2504 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 526 IncrementalHoareTripleChecker+Unchecked, 2092 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2413 IncrementalHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 412 mSDtfsCounter, 2413 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 588 SyntacticMatches, 24 SemanticMatches, 219 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=12, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 102 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1115 HoareAnnotationTreeSize, 18 FomulaSimplifications, 5079 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1601 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 911 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1149 ConstructedInterpolants, 15 QuantifiedInterpolants, 6924 SizeOfPredicates, 75 NumberOfNonLiveVariables, 2766 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 401/514 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2022-11-20 12:33:44,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-11-20 12:33:44,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-11-20 12:33:44,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_741,QUANTIFIED] [2022-11-20 12:33:44,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_748,QUANTIFIED] [2022-11-20 12:33:44,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 12:33:44,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9,QUANTIFIED] Derived loop invariant: ((((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && 0 == #memory_$Pointer$[\result][\result]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && (forall v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 : int :: (forall v_ArrVal_748 : int, v_ArrVal_741 : [int]int :: #memory_$Pointer$[#memory_$Pointer$[\result][\result] := v_ArrVal_741][\result][v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 + 8 := v_ArrVal_748][\result] == #memory_$Pointer$[\result][\result]) || v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9 < \result)) && \result == 0) && new_head == 0) && !(head == last) - InvariantResult [Line: 620]: Loop Invariant [2022-11-20 12:33:44,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((head == 0 && head == 0) && i == 0) && i <= index) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) && #memory_$Pointer$[head][s] == 0) || (((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && index == i) && s == head) && i == 1) && !(#memory_$Pointer$[head][head] == s)) && len + i == data) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0)) || ((((((((((((head == 0 && head == 0) && i == 1) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[s][s] == head) && i <= index + 1) && !(head == s)) && index <= 0) && len + i == data) && len == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 635]: Loop Invariant [2022-11-20 12:33:44,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,401 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,401 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((head == 0 && 2 + i <= unknown-#memory_int-unknown[s][8]) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || ((((((((((((head == 0 && s == head) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-20 12:33:44,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((head == 0 && unknown-#memory_int-unknown[s][8] <= len) && s == head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && len <= unknown-#memory_int-unknown[s][8]) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == s) && \result == 0) && new_head == 0) && s == 0) || (((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && i == 1) && #memory_$Pointer$[s][s] == 0) && len == 2) && \result == 0) && new_head == 0) && s == 0)) || (((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && i <= index) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && 0 <= i) && index <= 0) && len == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2022-11-20 12:33:44,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && 3 == \result) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) || (((((((((((((((head == 0 && head == 0) && i == 0) && index <= 0) && 2 == expected) && 2 == \result) && unknown-#memory_int-unknown[s][8] == len + i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) - InvariantResult [Line: 588]: Loop Invariant [2022-11-20 12:33:44,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((head == 0 && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && !(new_head == last)) && #memory_$Pointer$[new_head][new_head] == 0) && len == 2) && #memory_$Pointer$[new_head][new_head] == last) && new_head == 0) && len <= 1) && !(head == last)) || ((((head == 0 && \valid[head] == 1) && 2 == len) && len == 2) && head == last) - InvariantResult [Line: 613]: Loop Invariant [2022-11-20 12:33:44,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:33:44,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:33:44,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((head == 0 && head == 0) && index <= 0) && 2 + i <= len) && 2 == expected) && unknown-#memory_int-unknown[s][8] == len + i) && 0 <= i) && index <= 0) && len + i == data) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[head][8 + head] == 2) && \result == 0) && new_head == 0) && s == 0) || (((((((((((((((((((1 <= index && head == 0) && index <= 1) && 0 == #memory_$Pointer$[head][head]) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && 3 == unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][8 + #memory_$Pointer$[head][0]]) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && !(head == #memory_$Pointer$[head][0])) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0)) || (((((((((((((((((head == 0 && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && len == 2) && head == 0) && head == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] == len + i) && \result == 0) && new_head == 0) && len == i + 1) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 12:33:44,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94b98016-7eca-4a63-b582-93c5c1492d5a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE