./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a --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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- 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-b5237d8 [2022-11-21 14:01:10,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:01:10,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:01:10,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:01:10,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:01:10,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:01:10,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:01:10,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:01:10,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:01:10,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:01:10,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:01:10,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:01:10,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:01:10,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:01:10,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:01:10,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:01:10,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:01:10,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:01:10,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:01:10,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:01:10,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:01:10,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:01:10,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:01:10,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:01:10,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:01:10,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:01:10,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:01:10,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:01:10,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:01:10,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:01:10,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:01:10,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:01:10,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:01:10,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:01:10,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:01:10,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:01:10,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:01:10,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:01:10,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:01:10,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:01:10,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:01:10,224 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 14:01:10,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:01:10,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:01:10,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:01:10,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:01:10,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:01:10,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:01:10,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:01:10,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:01:10,265 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:01:10,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:01:10,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 14:01:10,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 14:01:10,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 14:01:10,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:01:10,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 14:01:10,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:01:10,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 14:01:10,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 14:01:10,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 14:01:10,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:01:10,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 14:01:10,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:01:10,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:01:10,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:01:10,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:01:10,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:01:10,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:01:10,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 14:01:10,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 14:01:10,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 14:01:10,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 14:01:10,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 14:01:10,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 14:01:10,273 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_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/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_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-11-21 14:01:10,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:01:10,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:01:10,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:01:10,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:01:10,681 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:01:10,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-21 14:01:13,718 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:01:13,987 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:01:13,987 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-21 14:01:14,012 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/data/cbfeb8db8/6e0947927d30441f881860baf7492c63/FLAG741e4fe19 [2022-11-21 14:01:14,034 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/data/cbfeb8db8/6e0947927d30441f881860baf7492c63 [2022-11-21 14:01:14,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:01:14,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:01:14,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:01:14,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:01:14,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:01:14,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2e4f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14, skipping insertion in model container [2022-11-21 14:01:14,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:01:14,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:01:14,332 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_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-21 14:01:14,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:01:14,544 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:01:14,561 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_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-21 14:01:14,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:01:14,638 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:01:14,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14 WrapperNode [2022-11-21 14:01:14,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:01:14,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:01:14,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:01:14,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:01:14,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,684 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-11-21 14:01:14,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:01:14,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:01:14,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:01:14,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:01:14,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:01:14,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:01:14,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:01:14,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:01:14,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (1/1) ... [2022-11-21 14:01:14,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:01:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:14,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:01:14,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:01:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-11-21 14:01:14,802 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-11-21 14:01:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 14:01:14,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 14:01:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 14:01:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:01:14,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:01:14,918 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:01:14,920 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:01:15,253 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:01:15,259 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:01:15,260 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 14:01:15,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:01:15 BoogieIcfgContainer [2022-11-21 14:01:15,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:01:15,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:01:15,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:01:15,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:01:15,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:01:14" (1/3) ... [2022-11-21 14:01:15,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4826d1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:01:15, skipping insertion in model container [2022-11-21 14:01:15,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:01:14" (2/3) ... [2022-11-21 14:01:15,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4826d1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:01:15, skipping insertion in model container [2022-11-21 14:01:15,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:01:15" (3/3) ... [2022-11-21 14:01:15,307 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-11-21 14:01:15,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:01:15,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 14:01:15,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:01:15,403 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;@7403a08a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:01:15,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 14:01:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:01:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 14:01:15,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:15,418 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-21 14:01:15,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-11-21 14:01:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:15,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454911795] [2022-11-21 14:01:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:15,638 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-21 14:01:15,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454911795] [2022-11-21 14:01:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454911795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:15,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:15,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:01:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744093320] [2022-11-21 14:01:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:15,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:01:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:01:15,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:01:15,679 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:01:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:15,704 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-11-21 14:01:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:01:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-21 14:01:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:15,714 INFO L225 Difference]: With dead ends: 77 [2022-11-21 14:01:15,715 INFO L226 Difference]: Without dead ends: 37 [2022-11-21 14:01:15,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:01:15,722 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:15,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-21 14:01:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-21 14:01:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:01:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-11-21 14:01:15,762 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-11-21 14:01:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:15,763 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-11-21 14:01:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:01:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-11-21 14:01:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 14:01:15,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:15,766 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-21 14:01:15,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 14:01:15,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-11-21 14:01:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827385166] [2022-11-21 14:01:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,122 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-21 14:01:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827385166] [2022-11-21 14:01:16,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827385166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:16,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:16,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:01:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038327387] [2022-11-21 14:01:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 14:01:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 14:01:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:01:16,130 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:01:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:16,213 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-11-21 14:01:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:16,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-21 14:01:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:16,217 INFO L225 Difference]: With dead ends: 45 [2022-11-21 14:01:16,217 INFO L226 Difference]: Without dead ends: 43 [2022-11-21 14:01:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-21 14:01:16,222 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:16,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-21 14:01:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-21 14:01:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:01:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-11-21 14:01:16,237 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-11-21 14:01:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:16,239 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-11-21 14:01:16,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:01:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-11-21 14:01:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 14:01:16,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:16,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:16,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 14:01:16,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-11-21 14:01:16,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:16,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925066825] [2022-11-21 14:01:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:01:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:16,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925066825] [2022-11-21 14:01:16,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925066825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:16,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:16,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:01:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652516128] [2022-11-21 14:01:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:16,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 14:01:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 14:01:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 14:01:16,499 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:01:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:16,600 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-11-21 14:01:16,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:01:16,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-21 14:01:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:16,606 INFO L225 Difference]: With dead ends: 86 [2022-11-21 14:01:16,606 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 14:01:16,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:01:16,608 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:16,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:01:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 14:01:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-11-21 14:01:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 14:01:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-21 14:01:16,625 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-11-21 14:01:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:16,626 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-21 14:01:16,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:01:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-21 14:01:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 14:01:16,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:16,629 INFO L195 NwaCegarLoop]: trace histogram [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-21 14:01:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 14:01:16,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-11-21 14:01:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:16,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542994383] [2022-11-21 14:01:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 14:01:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:01:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:16,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542994383] [2022-11-21 14:01:16,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542994383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:16,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960790704] [2022-11-21 14:01:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:16,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:16,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:16,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 14:01:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:17,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 14:01:17,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:01:17,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:01:17,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960790704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:17,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:17,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-21 14:01:17,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141469553] [2022-11-21 14:01:17,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:17,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 14:01:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 14:01:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-21 14:01:17,413 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 14:01:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:17,754 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-11-21 14:01:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:01:17,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-21 14:01:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:17,757 INFO L225 Difference]: With dead ends: 118 [2022-11-21 14:01:17,758 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 14:01:17,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-21 14:01:17,760 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:17,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 338 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:01:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 14:01:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-11-21 14:01:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-21 14:01:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-11-21 14:01:17,773 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-11-21 14:01:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:17,773 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-11-21 14:01:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 14:01:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-11-21 14:01:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 14:01:17,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:17,775 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] [2022-11-21 14:01:17,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 14:01:17,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:17,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-11-21 14:01:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:17,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429820741] [2022-11-21 14:01:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 14:01:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:01:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:18,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429820741] [2022-11-21 14:01:18,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429820741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:18,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:18,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 14:01:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387100450] [2022-11-21 14:01:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:18,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:01:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:01:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:01:18,297 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:01:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:18,396 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-11-21 14:01:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 14:01:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-21 14:01:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:18,398 INFO L225 Difference]: With dead ends: 75 [2022-11-21 14:01:18,398 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 14:01:18,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 14:01:18,399 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:18,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:01:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 14:01:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-11-21 14:01:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-21 14:01:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-11-21 14:01:18,412 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-11-21 14:01:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:18,413 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-11-21 14:01:18,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:01:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-11-21 14:01:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 14:01:18,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:18,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:18,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 14:01:18,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-11-21 14:01:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811098850] [2022-11-21 14:01:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 14:01:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 14:01:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811098850] [2022-11-21 14:01:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811098850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900841383] [2022-11-21 14:01:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:18,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:18,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:18,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:18,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 14:01:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:18,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 14:01:18,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:18,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:18,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:18,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:18,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:18,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:18,870 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 16 treesize of output 18 [2022-11-21 14:01:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:18,880 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 16 treesize of output 18 [2022-11-21 14:01:19,081 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-21 14:01:19,087 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-21 14:01:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:01:19,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:19,189 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 10 treesize of output 4 [2022-11-21 14:01:19,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:19,343 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 2 case distinctions, treesize of input 25 treesize of output 31 [2022-11-21 14:01:19,349 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 36 treesize of output 24 [2022-11-21 14:01:19,355 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 7 treesize of output 3 [2022-11-21 14:01:19,364 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-21 14:01:19,365 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-11-21 14:01:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 14:01:19,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900841383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:19,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:19,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-11-21 14:01:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473458860] [2022-11-21 14:01:19,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:19,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 14:01:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 14:01:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-21 14:01:19,405 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 14:01:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:20,843 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2022-11-21 14:01:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 14:01:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-11-21 14:01:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:20,846 INFO L225 Difference]: With dead ends: 326 [2022-11-21 14:01:20,847 INFO L226 Difference]: Without dead ends: 253 [2022-11-21 14:01:20,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2022-11-21 14:01:20,849 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 247 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:20,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 852 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 14:01:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-21 14:01:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2022-11-21 14:01:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.316831683168317) internal successors, (133), 111 states have internal predecessors, (133), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2022-11-21 14:01:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2022-11-21 14:01:20,904 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2022-11-21 14:01:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:20,906 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-11-21 14:01:20,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 14:01:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2022-11-21 14:01:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 14:01:20,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:20,914 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-21 14:01:20,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:21,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:21,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-11-21 14:01:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:21,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256434693] [2022-11-21 14:01:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:01:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:21,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256434693] [2022-11-21 14:01:21,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256434693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:21,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:21,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:01:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144750143] [2022-11-21 14:01:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:21,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 14:01:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 14:01:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:01:21,353 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 14:01:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:21,505 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2022-11-21 14:01:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:01:21,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-21 14:01:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:21,507 INFO L225 Difference]: With dead ends: 179 [2022-11-21 14:01:21,507 INFO L226 Difference]: Without dead ends: 148 [2022-11-21 14:01:21,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:01:21,509 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:21,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:01:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-21 14:01:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2022-11-21 14:01:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 113 states have internal predecessors, (135), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2022-11-21 14:01:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2022-11-21 14:01:21,534 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2022-11-21 14:01:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:21,534 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2022-11-21 14:01:21,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 14:01:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2022-11-21 14:01:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 14:01:21,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:21,536 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-21 14:01:21,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 14:01:21,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-11-21 14:01:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:21,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920111003] [2022-11-21 14:01:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 14:01:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920111003] [2022-11-21 14:01:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920111003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:21,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:21,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44384612] [2022-11-21 14:01:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:21,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:21,662 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 14:01:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:21,736 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2022-11-21 14:01:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-11-21 14:01:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:21,740 INFO L225 Difference]: With dead ends: 150 [2022-11-21 14:01:21,740 INFO L226 Difference]: Without dead ends: 138 [2022-11-21 14:01:21,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:01:21,742 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:21,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-21 14:01:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2022-11-21 14:01:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 93 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-21 14:01:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2022-11-21 14:01:21,783 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2022-11-21 14:01:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:21,784 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2022-11-21 14:01:21,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 14:01:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2022-11-21 14:01:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 14:01:21,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:21,786 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-21 14:01:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 14:01:21,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-11-21 14:01:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92099867] [2022-11-21 14:01:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:01:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92099867] [2022-11-21 14:01:22,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92099867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:22,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:22,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:01:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293908403] [2022-11-21 14:01:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:22,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 14:01:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 14:01:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:01:22,027 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 14:01:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:22,118 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2022-11-21 14:01:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:01:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-21 14:01:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:22,121 INFO L225 Difference]: With dead ends: 202 [2022-11-21 14:01:22,122 INFO L226 Difference]: Without dead ends: 94 [2022-11-21 14:01:22,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-21 14:01:22,125 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:22,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-21 14:01:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-11-21 14:01:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-11-21 14:01:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-11-21 14:01:22,157 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2022-11-21 14:01:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:22,157 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-11-21 14:01:22,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 14:01:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-11-21 14:01:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 14:01:22,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:22,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-21 14:01:22,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 14:01:22,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2022-11-21 14:01:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:22,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398693268] [2022-11-21 14:01:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 14:01:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 14:01:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-21 14:01:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:22,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398693268] [2022-11-21 14:01:22,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398693268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:22,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904580741] [2022-11-21 14:01:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:22,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:22,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:22,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 14:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:22,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 14:01:22,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:22,975 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-21 14:01:23,046 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 14:01:23,046 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-21 14:01:23,111 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-21 14:01:23,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-21 14:01:23,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-21 14:01:23,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-21 14:01:23,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:01:23,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:01:23,190 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 63 treesize of output 13 [2022-11-21 14:01:23,194 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 13 treesize of output 9 [2022-11-21 14:01:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:01:23,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:23,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:23,606 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 124 treesize of output 127 [2022-11-21 14:01:23,611 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 136 treesize of output 128 [2022-11-21 14:01:23,618 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 128 treesize of output 124 [2022-11-21 14:01:23,703 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 22 treesize of output 18 [2022-11-21 14:01:23,715 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 8 treesize of output 4 [2022-11-21 14:01:23,723 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 14:01:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 14:01:23,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904580741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:23,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:23,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2022-11-21 14:01:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859895341] [2022-11-21 14:01:23,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 14:01:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 14:01:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-11-21 14:01:23,920 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-21 14:01:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:25,329 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-11-21 14:01:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 14:01:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 46 [2022-11-21 14:01:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:25,331 INFO L225 Difference]: With dead ends: 185 [2022-11-21 14:01:25,331 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 14:01:25,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2022-11-21 14:01:25,333 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 284 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:25,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 440 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 14:01:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 14:01:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-11-21 14:01:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 57 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-21 14:01:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2022-11-21 14:01:25,345 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 46 [2022-11-21 14:01:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:25,345 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2022-11-21 14:01:25,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-21 14:01:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-11-21 14:01:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 14:01:25,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:25,347 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-21 14:01:25,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:25,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 14:01:25,553 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:25,554 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-11-21 14:01:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529531311] [2022-11-21 14:01:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 14:01:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529531311] [2022-11-21 14:01:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529531311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819914273] [2022-11-21 14:01:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:26,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:26,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:26,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:26,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 14:01:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:26,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-21 14:01:26,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:26,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:26,791 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:26,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:01:26,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:26,809 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:26,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:26,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:01:27,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:27,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:01:27,371 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 14:01:27,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-11-21 14:01:27,380 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 31 treesize of output 23 [2022-11-21 14:01:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 14:01:28,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:28,152 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 10 treesize of output 4 [2022-11-21 14:01:28,478 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 10 treesize of output 4 [2022-11-21 14:01:28,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:28,830 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 140 [2022-11-21 14:01:28,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:28,844 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-11-21 14:01:28,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:28,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 539 treesize of output 539 [2022-11-21 14:01:28,908 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 663 treesize of output 627 [2022-11-21 14:01:28,933 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 622 treesize of output 606 [2022-11-21 14:01:28,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:28,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 737 treesize of output 645 [2022-11-21 14:01:29,963 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 8 treesize of output 4 [2022-11-21 14:01:29,983 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 8 treesize of output 4 [2022-11-21 14:01:29,995 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 8 treesize of output 4 [2022-11-21 14:01:30,005 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 8 treesize of output 4 [2022-11-21 14:01:30,043 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 8 treesize of output 4 [2022-11-21 14:01:30,060 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 8 treesize of output 4 [2022-11-21 14:01:30,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:30,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 126 [2022-11-21 14:01:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 14:01:30,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819914273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:30,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:30,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2022-11-21 14:01:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047499544] [2022-11-21 14:01:30,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:30,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 14:01:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 14:01:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2022-11-21 14:01:30,655 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 14:01:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:34,167 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2022-11-21 14:01:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 14:01:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Word has length 43 [2022-11-21 14:01:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:34,170 INFO L225 Difference]: With dead ends: 184 [2022-11-21 14:01:34,170 INFO L226 Difference]: Without dead ends: 123 [2022-11-21 14:01:34,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=563, Invalid=4129, Unknown=0, NotChecked=0, Total=4692 [2022-11-21 14:01:34,175 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 261 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 804 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 14:01:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-21 14:01:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-11-21 14:01:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 85 states have internal predecessors, (96), 15 states have call successors, (15), 7 states have call predecessors, (15), 15 states have return successors, (26), 15 states have call predecessors, (26), 13 states have call successors, (26) [2022-11-21 14:01:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2022-11-21 14:01:34,201 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 43 [2022-11-21 14:01:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:34,201 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-11-21 14:01:34,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 14:01:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-11-21 14:01:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 14:01:34,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:34,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-21 14:01:34,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 14:01:34,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2022-11-21 14:01:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:34,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464316962] [2022-11-21 14:01:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 14:01:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:34,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464316962] [2022-11-21 14:01:34,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464316962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:34,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:34,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 14:01:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071354559] [2022-11-21 14:01:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:34,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 14:01:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 14:01:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:01:34,635 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 14:01:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:34,715 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2022-11-21 14:01:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 14:01:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-11-21 14:01:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:34,717 INFO L225 Difference]: With dead ends: 137 [2022-11-21 14:01:34,717 INFO L226 Difference]: Without dead ends: 135 [2022-11-21 14:01:34,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 14:01:34,718 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:34,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-21 14:01:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2022-11-21 14:01:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.240506329113924) internal successors, (98), 85 states have internal predecessors, (98), 15 states have call successors, (15), 7 states have call predecessors, (15), 15 states have return successors, (26), 17 states have call predecessors, (26), 13 states have call successors, (26) [2022-11-21 14:01:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2022-11-21 14:01:34,736 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 44 [2022-11-21 14:01:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:34,736 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2022-11-21 14:01:34,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 14:01:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2022-11-21 14:01:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 14:01:34,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:34,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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-21 14:01:34,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 14:01:34,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2022-11-21 14:01:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:34,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622663448] [2022-11-21 14:01:34,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 14:01:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 14:01:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 14:01:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622663448] [2022-11-21 14:01:34,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622663448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141220474] [2022-11-21 14:01:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:34,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:34,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 14:01:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-21 14:01:35,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:35,189 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-21 14:01:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:35,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,228 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 16 treesize of output 18 [2022-11-21 14:01:35,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:35,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,245 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 16 treesize of output 18 [2022-11-21 14:01:35,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 14:01:35,337 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-21 14:01:35,389 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-21 14:01:35,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,415 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:01:35,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-21 14:01:35,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:35,442 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:01:35,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2022-11-21 14:01:35,656 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-21 14:01:35,661 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-21 14:01:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 14:01:35,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:35,748 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 10 treesize of output 4 [2022-11-21 14:01:35,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_821 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_821) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) is different from false [2022-11-21 14:01:36,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:36,194 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-11-21 14:01:36,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:36,208 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 624 treesize of output 614 [2022-11-21 14:01:36,218 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 598 treesize of output 534 [2022-11-21 14:01:36,232 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 642 treesize of output 610 [2022-11-21 14:01:36,283 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 550 treesize of output 518 [2022-11-21 14:01:36,393 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 412 treesize of output 392 [2022-11-21 14:01:36,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:36,579 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 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-21 14:01:36,585 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 276 treesize of output 258 [2022-11-21 14:01:36,598 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 85 treesize of output 81 [2022-11-21 14:01:36,603 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 166 treesize of output 154 [2022-11-21 14:01:36,608 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 154 treesize of output 130 [2022-11-21 14:01:36,693 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 10 treesize of output 8 [2022-11-21 14:01:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2022-11-21 14:01:36,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141220474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:36,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:36,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2022-11-21 14:01:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302105397] [2022-11-21 14:01:36,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:36,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-21 14:01:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:36,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-21 14:01:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=326, Unknown=2, NotChecked=36, Total=420 [2022-11-21 14:01:36,719 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-21 14:01:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:37,931 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-11-21 14:01:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 14:01:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 47 [2022-11-21 14:01:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:37,933 INFO L225 Difference]: With dead ends: 226 [2022-11-21 14:01:37,933 INFO L226 Difference]: Without dead ends: 134 [2022-11-21 14:01:37,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=960, Unknown=2, NotChecked=68, Total=1332 [2022-11-21 14:01:37,935 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 116 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:37,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 580 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 402 Invalid, 0 Unknown, 61 Unchecked, 0.5s Time] [2022-11-21 14:01:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-21 14:01:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 84. [2022-11-21 14:01:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 65 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-21 14:01:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-11-21 14:01:37,952 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 47 [2022-11-21 14:01:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:37,953 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-11-21 14:01:37,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-21 14:01:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-11-21 14:01:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 14:01:37,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:37,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:37,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:38,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 14:01:38,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-11-21 14:01:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:38,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616700391] [2022-11-21 14:01:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 14:01:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 14:01:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:38,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616700391] [2022-11-21 14:01:38,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616700391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578319347] [2022-11-21 14:01:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:38,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:38,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 14:01:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:38,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 14:01:38,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 14:01:38,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 14:01:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578319347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:38,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:01:38,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-21 14:01:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713475756] [2022-11-21 14:01:38,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 14:01:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 14:01:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-21 14:01:38,661 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-21 14:01:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:38,858 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-11-21 14:01:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 14:01:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2022-11-21 14:01:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:38,860 INFO L225 Difference]: With dead ends: 142 [2022-11-21 14:01:38,860 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 14:01:38,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-21 14:01:38,861 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:38,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 169 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:01:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 14:01:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-21 14:01:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.196969696969697) internal successors, (79), 68 states have internal predecessors, (79), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-21 14:01:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-11-21 14:01:38,887 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 46 [2022-11-21 14:01:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:38,887 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-11-21 14:01:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-21 14:01:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-11-21 14:01:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 14:01:38,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:38,889 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:38,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 14:01:39,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 14:01:39,097 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2022-11-21 14:01:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:39,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943218075] [2022-11-21 14:01:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:01:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-21 14:01:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943218075] [2022-11-21 14:01:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943218075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169388130] [2022-11-21 14:01:40,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:01:40,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:40,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:40,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 14:01:40,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:01:40,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:40,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-21 14:01:40,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:40,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:40,258 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:01:40,259 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 14:01:40,263 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 5 treesize of output 3 [2022-11-21 14:01:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:40,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:01:40,288 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:01:40,288 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 14:01:40,298 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 5 treesize of output 3 [2022-11-21 14:01:40,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:40,692 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-21 14:01:40,693 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 80 [2022-11-21 14:01:40,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:40,730 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2022-11-21 14:01:40,731 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 79 [2022-11-21 14:01:57,623 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:09,775 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:17,974 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:28,178 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:36,350 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:44,612 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:02:45,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:02:45,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169388130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:02:45,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:02:45,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-11-21 14:02:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152892465] [2022-11-21 14:02:45,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:02:45,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 14:02:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:02:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 14:02:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=997, Unknown=7, NotChecked=0, Total=1122 [2022-11-21 14:02:45,274 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 14:02:48,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:02:52,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:02:54,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:02:56,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:02:58,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:00,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:02,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:04,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:12,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:14,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:17,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:19,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:29,108 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:31,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:03:39,214 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:57,328 WARN L233 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 65 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:59,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:03,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:05,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:07,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:09,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:11,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:16,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:18,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:20,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:22,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:24,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:26,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:28,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:30,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:32,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:34,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:36,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:04:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:36,399 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2022-11-21 14:04:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 14:04:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2022-11-21 14:04:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:36,400 INFO L225 Difference]: With dead ends: 155 [2022-11-21 14:04:36,400 INFO L226 Difference]: Without dead ends: 80 [2022-11-21 14:04:36,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 111.9s TimeCoverageRelationStatistics Valid=360, Invalid=2382, Unknown=14, NotChecked=0, Total=2756 [2022-11-21 14:04:36,402 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 179 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 68 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:36,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 430 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 546 Invalid, 31 Unknown, 0 Unchecked, 63.3s Time] [2022-11-21 14:04:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-21 14:04:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-11-21 14:04:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-21 14:04:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-11-21 14:04:36,418 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 50 [2022-11-21 14:04:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:36,418 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2022-11-21 14:04:36,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 14:04:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-11-21 14:04:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 14:04:36,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:36,419 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:36,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 14:04:36,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:36,626 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:04:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-11-21 14:04:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:36,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521767443] [2022-11-21 14:04:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:04:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:04:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 14:04:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 14:04:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 14:04:37,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:37,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521767443] [2022-11-21 14:04:37,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521767443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:37,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948002279] [2022-11-21 14:04:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:37,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:37,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:37,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 14:04:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:37,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-21 14:04:37,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:37,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:37,959 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:37,967 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:37,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:37,977 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 23 treesize of output 23 [2022-11-21 14:04:37,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:37,984 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 16 treesize of output 18 [2022-11-21 14:04:38,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 14:04:38,410 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 39 treesize of output 38 [2022-11-21 14:04:38,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:38,417 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 20 treesize of output 22 [2022-11-21 14:04:38,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:38,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-21 14:04:38,755 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-21 14:04:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 14:04:38,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:39,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1150) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1149 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1149) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2022-11-21 14:04:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948002279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:39,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:39,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-11-21 14:04:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373891726] [2022-11-21 14:04:39,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:39,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 14:04:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 14:04:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=433, Unknown=10, NotChecked=42, Total=552 [2022-11-21 14:04:39,059 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-21 14:04:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:41,320 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-11-21 14:04:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 14:04:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2022-11-21 14:04:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:41,322 INFO L225 Difference]: With dead ends: 124 [2022-11-21 14:04:41,322 INFO L226 Difference]: Without dead ends: 104 [2022-11-21 14:04:41,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=353, Invalid=1362, Unknown=11, NotChecked=80, Total=1806 [2022-11-21 14:04:41,324 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 327 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:41,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 319 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 14:04:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-21 14:04:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2022-11-21 14:04:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-21 14:04:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-11-21 14:04:41,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-11-21 14:04:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:41,340 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-11-21 14:04:41,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-21 14:04:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-11-21 14:04:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 14:04:41,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:41,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:41,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 14:04:41,550 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:04:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-11-21 14:04:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86052612] [2022-11-21 14:04:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:04:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:04:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 14:04:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 14:04:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 14:04:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:42,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86052612] [2022-11-21 14:04:42,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86052612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:42,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869343035] [2022-11-21 14:04:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:42,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:42,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 14:04:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:42,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-21 14:04:42,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,708 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:42,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 14:04:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,725 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:42,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 14:04:43,416 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 14:04:43,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-11-21 14:04:43,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:43,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-21 14:04:44,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:44,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:44,360 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 14:04:44,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2022-11-21 14:04:44,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:44,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2022-11-21 14:04:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:04:44,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:45,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869343035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:45,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:45,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-11-21 14:04:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065602704] [2022-11-21 14:04:45,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:45,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 14:04:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 14:04:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2022-11-21 14:04:45,623 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-21 14:04:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:48,237 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-11-21 14:04:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 14:04:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2022-11-21 14:04:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:48,238 INFO L225 Difference]: With dead ends: 83 [2022-11-21 14:04:48,238 INFO L226 Difference]: Without dead ends: 78 [2022-11-21 14:04:48,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=549, Invalid=3357, Unknown=0, NotChecked=0, Total=3906 [2022-11-21 14:04:48,240 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 199 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:48,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 424 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 14:04:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-21 14:04:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-11-21 14:04:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-21 14:04:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-11-21 14:04:48,260 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-11-21 14:04:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:48,260 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-11-21 14:04:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-21 14:04:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-11-21 14:04:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 14:04:48,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:48,262 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:48,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:48,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 14:04:48,472 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:04:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-11-21 14:04:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431123614] [2022-11-21 14:04:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:04:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:04:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 14:04:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 14:04:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-21 14:04:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431123614] [2022-11-21 14:04:48,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431123614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499638074] [2022-11-21 14:04:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:48,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:48,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 14:04:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:49,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 14:04:49,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:49,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:49,190 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:49,194 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 23 treesize of output 23 [2022-11-21 14:04:49,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:49,203 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:49,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:49,208 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 23 treesize of output 23 [2022-11-21 14:04:49,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:49,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-21 14:04:49,739 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 14:04:49,739 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 37 treesize of output 36 [2022-11-21 14:04:50,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:50,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:04:50,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-21 14:04:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 14:04:50,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:50,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499638074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:50,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:50,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2022-11-21 14:04:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368378510] [2022-11-21 14:04:50,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:50,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 14:04:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:50,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 14:04:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=527, Unknown=1, NotChecked=0, Total=600 [2022-11-21 14:04:50,432 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-21 14:04:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:51,876 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-11-21 14:04:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 14:04:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-11-21 14:04:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:51,878 INFO L225 Difference]: With dead ends: 81 [2022-11-21 14:04:51,878 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 14:04:51,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1047, Unknown=1, NotChecked=0, Total=1332 [2022-11-21 14:04:51,879 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 204 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:51,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 238 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 14:04:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 14:04:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-11-21 14:04:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-21 14:04:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-11-21 14:04:51,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 53 [2022-11-21 14:04:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:51,895 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-11-21 14:04:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-21 14:04:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-11-21 14:04:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 14:04:51,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:51,896 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:51,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:52,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 14:04:52,103 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:04:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-11-21 14:04:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610480805] [2022-11-21 14:04:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:04:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:04:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 14:04:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 14:04:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 14:04:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610480805] [2022-11-21 14:04:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610480805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 14:04:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589166618] [2022-11-21 14:04:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:52,295 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-21 14:04:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:52,350 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-21 14:04:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:04:52,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-11-21 14:04:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:52,356 INFO L225 Difference]: With dead ends: 77 [2022-11-21 14:04:52,356 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 14:04:52,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:52,357 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:52,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:04:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 14:04:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-11-21 14:04:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-21 14:04:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-21 14:04:52,377 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 59 [2022-11-21 14:04:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:52,377 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-21 14:04:52,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-21 14:04:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-21 14:04:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 14:04:52,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:52,384 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:52,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 14:04:52,385 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:04:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-11-21 14:04:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:52,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497070862] [2022-11-21 14:04:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:04:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 14:04:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 14:04:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 14:04:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 14:04:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497070862] [2022-11-21 14:04:53,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497070862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601563915] [2022-11-21 14:04:53,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:04:53,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:53,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:53,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:53,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 14:04:53,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 14:04:53,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:04:53,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-21 14:04:53,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:53,864 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-21 14:04:53,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:53,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 14:04:53,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:53,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-21 14:04:54,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:54,664 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-21 14:04:54,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 44 [2022-11-21 14:04:54,686 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-21 14:04:54,686 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 1 case distinctions, treesize of input 25 treesize of output 31 [2022-11-21 14:04:54,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:54,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-21 14:04:54,713 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 7 treesize of output 3 [2022-11-21 14:04:54,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 21 treesize of output 17 [2022-11-21 14:04:56,873 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22|) 4))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|) 0)) (= (select .cse1 0) 0) (= (select .cse1 4) 0))))) is different from true [2022-11-21 14:05:07,225 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:13,471 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:21,574 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:22,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:22,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:22,275 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-21 14:05:22,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2022-11-21 14:05:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:22,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:22,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-11-21 14:05:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-21 14:05:23,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:40,896 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:51,103 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:01,292 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:01,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1508))) (or (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1507) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1508))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1507))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|))))))) is different from false [2022-11-21 14:06:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601563915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:06:02,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:06:02,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 41 [2022-11-21 14:06:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439206854] [2022-11-21 14:06:02,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:06:02,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 14:06:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:06:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 14:06:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2332, Unknown=8, NotChecked=198, Total=2756 [2022-11-21 14:06:02,005 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-21 14:06:13,474 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:19,743 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:25,875 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:32,013 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:06:35,334 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-11-21 14:06:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-21 14:06:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) Word has length 60 [2022-11-21 14:06:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:06:35,335 INFO L225 Difference]: With dead ends: 91 [2022-11-21 14:06:35,335 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 14:06:35,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 97.6s TimeCoverageRelationStatistics Valid=963, Invalid=6693, Unknown=8, NotChecked=346, Total=8010 [2022-11-21 14:06:35,337 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 321 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:06:35,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 506 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 988 Invalid, 0 Unknown, 76 Unchecked, 2.2s Time] [2022-11-21 14:06:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 14:06:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 14:06:35,338 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-21 14:06:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 14:06:35,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-11-21 14:06:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:06:35,339 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 14:06:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-21 14:06:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 14:06:35,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 14:06:35,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 14:06:35,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-21 14:06:35,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:06:35,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 14:07:13,061 WARN L233 SmtUtils]: Spent 32.14s on a formula simplification. DAG size of input: 361 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 14:07:13,905 INFO L895 garLoopResultBuilder]: At program point L622(line 622) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and .cse0 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse1 .cse2 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse5 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) .cse6)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|)) (.cse9 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse4 .cse5) 0) .cse0 (= (select .cse4 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) .cse6) |ULTIMATE.start_main_~x~0#1.offset|) .cse1 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse7 .cse5) 0) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse8) .cse9) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) .cse2 (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) .cse3 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= .cse8 |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse7 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ |ULTIMATE.start_re_insert_~x#1.base| 2) (select .cse10 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse10 |ULTIMATE.start_re_insert_~x#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 (select .cse11 .cse9)) (= (select .cse11 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-11-21 14:07:13,905 INFO L895 garLoopResultBuilder]: At program point L622-1(line 622) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret22#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) [2022-11-21 14:07:13,905 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2022-11-21 14:07:13,905 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-11-21 14:07:13,905 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2022-11-21 14:07:13,906 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-11-21 14:07:13,906 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2022-11-21 14:07:13,906 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2022-11-21 14:07:13,906 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 14:07:13,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 14:07:13,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 14:07:13,907 INFO L902 garLoopResultBuilder]: At program point L623(lines 601 624) the Hoare annotation is: true [2022-11-21 14:07:13,907 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2022-11-21 14:07:13,907 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2022-11-21 14:07:13,907 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2022-11-21 14:07:13,907 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 607 617) the Hoare annotation is: (let ((.cse30 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse29 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse34 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse8 (select .cse29 .cse34)) (.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse5 (select .cse30 .cse34)) (.cse33 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse32 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse19 (= (select .cse33 .cse32) 0)) (.cse0 (= (select .cse33 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)) (.cse3 (= .cse5 0)) (.cse21 (= (select .cse31 .cse32) 0)) (.cse16 (select .cse18 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (.cse12 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse23 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse20 (+ |ULTIMATE.start_main_~n~0#1.base| 2)) (.cse24 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse13 (= |ULTIMATE.start_main_~tail~0#1.offset| 0)) (.cse14 (not (= |ULTIMATE.start_main_~tail~0#1.base| 0))) (.cse2 (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse31 |ULTIMATE.start_main_~n~0#1.offset|))) (.cse25 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse6 (select .cse30 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse15 (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)) (.cse22 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse4 (= 0 .cse8)) (.cse7 (select .cse29 |ULTIMATE.start_main_~x~0#1.offset|))) (or (and (let ((.cse1 (let ((.cse10 (let ((.cse17 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse17 .cse3 (= (select .cse18 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse4) (and .cse19 .cse17 (<= .cse20 |ULTIMATE.start_main_~tail~0#1.base|) .cse21 .cse22)))) (.cse11 (not (= .cse16 |ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (or (and (= .cse5 .cse6) (= .cse7 .cse8)) (let ((.cse9 (+ .cse7 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse6) .cse9) .cse8) (= .cse5 (select (select |#memory_$Pointer$.base| .cse6) .cse9)))))))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) .cse23 .cse24 .cse25 (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31| Int)) (let ((.cse26 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31|))) (and (= (select .cse26 0) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31| 0)) (= (select .cse26 4) 0))))) (and (= |ULTIMATE.start_main_~#list~0#1.base| .cse6) .cse19 .cse0 .cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) .cse21 (not (= .cse16 0)) .cse12 .cse23 (<= .cse20 |ULTIMATE.start_main_~#list~0#1.base|) .cse24 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) .cse13 .cse14 .cse2 (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) .cse25 (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse6) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse27 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse28 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (and (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse27) 4)) (= (select .cse28 4) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse27) (= (select (select |#memory_$Pointer$.offset| .cse27) 4) 0) (= (select .cse28 0) 0)))) .cse15 .cse22 .cse4 (= .cse7 |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-11-21 14:07:13,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 14:07:13,908 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 617) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse18 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse2 (= (select .cse9 .cse18) 0)) (.cse4 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse8 (= 0 (select .cse17 .cse18))) (.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse13 (+ |ULTIMATE.start_main_~n~0#1.base| 2)) (.cse6 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse16 (= |ULTIMATE.start_main_~n~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse6 .cse7 .cse8) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse11 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select .cse10 .cse11) 0) (= (select .cse10 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse12 .cse11) 0) (not (= (select .cse5 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= .cse13 |ULTIMATE.start_main_~#list~0#1.base|) .cse7 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse12 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse14 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse15 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (and (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse14) 4)) (= (select .cse15 4) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse14) (= (select (select |#memory_$Pointer$.offset| .cse14) 4) 0) (= (select .cse15 0) 0)))) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) .cse16 .cse8 (= (select .cse17 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|))) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3|) 4) 0))) .cse3 (<= .cse13 |ULTIMATE.start_main_~tail~0#1.base|) .cse6 .cse7 .cse16)))) [2022-11-21 14:07:13,908 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2022-11-21 14:07:13,908 INFO L895 garLoopResultBuilder]: At program point L620-2(line 620) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse1 (+ .cse8 4)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse9 .cse7))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= |ULTIMATE.start_main_~#list~0#1.base| .cse0) (= (select .cse3 .cse4) 0) (= (select .cse3 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse5 .cse4) 0) (not |ULTIMATE.start_main_#t~short21#1|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|) (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= (select .cse6 .cse7) (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse5 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 .cse2) (= .cse8 |ULTIMATE.start_main_~#list~0#1.offset|))))) [2022-11-21 14:07:13,908 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2022-11-21 14:07:13,908 INFO L895 garLoopResultBuilder]: At program point L620-4(line 620) the Hoare annotation is: (let ((.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse8 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse2 (select .cse11 .cse10)) (.cse0 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select .cse11 |ULTIMATE.start_main_~x~0#1.offset|))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) (+ .cse1 4)) .cse2) (= |ULTIMATE.start_main_~#list~0#1.base| .cse0) (= (select .cse3 .cse4) 0) .cse5 (= (select .cse3 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short21#1| .cse6 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse7 .cse4) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) .cse8 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse7 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 .cse2) (= (select .cse9 .cse10) (select (select |#memory_$Pointer$.base| .cse0) (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (= .cse1 |ULTIMATE.start_main_~#list~0#1.offset|)))) (and .cse5 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| .cse6 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) .cse8))) [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2022-11-21 14:07:13,909 INFO L902 garLoopResultBuilder]: At program point is_list_containing_xENTRY(lines 593 600) the Hoare annotation is: true [2022-11-21 14:07:13,910 INFO L895 garLoopResultBuilder]: At program point L598(line 598) the Hoare annotation is: (let ((.cse0 (let ((.cse19 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse18 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse19)) (.cse17 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse19))) (and (= .cse17 |is_list_containing_x_#t~mem14.base|) (= |is_list_containing_x_#t~mem14.offset| .cse18) (or (not (= .cse18 0)) (not (= .cse17 0)))))))) (and (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8|))) (let ((.cse1 (select .cse3 0)) (.cse2 (select .cse3 4))) (or (not (= (select (select |#memory_$Pointer$.base| .cse1) 4) .cse2)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 0) (not (<= (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 2) .cse1)) (not (= .cse2 0)))))) (forall ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse10 0)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (select .cse10 4)) (.cse7 (select .cse9 4)) (.cse6 (+ .cse8 4)) (.cse5 (select .cse9 0))) (or (not (= .cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (not (= .cse7 0)) (not (= .cse4 0)) (not (= .cse8 0)) (not (= .cse7 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (= .cse5 |ULTIMATE.start_main_~x~0#1.base|)))))) (and (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (= (select (select |#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4)) 0)) (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (= 0 (select (select |#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|) 0) 0)) (not (<= (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 2) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|) 0))) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 0)))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse11 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27|))) (let ((.cse12 (select .cse11 0))) (or (not (= (select .cse11 4) 0)) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27|) .cse12)) (= .cse12 0))))) .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse13 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|)) (.cse14 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21| 0) (not (= (select .cse13 4) 0)) (not (= (select .cse13 0) 0)) (not (= (select .cse14 4) 0)) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|) (select .cse14 0)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse15 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (or (not (= (select .cse15 0) 0)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse16) 4))) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse16)) (not (= (select (select |#memory_$Pointer$.offset| .cse16) 4) 0)) (not (= (select .cse15 4) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0))))))) [2022-11-21 14:07:13,910 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2022-11-21 14:07:13,910 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2022-11-21 14:07:13,910 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2022-11-21 14:07:13,910 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2022-11-21 14:07:13,911 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2022-11-21 14:07:13,911 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-11-21 14:07:13,911 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-11-21 14:07:13,911 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-11-21 14:07:13,911 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-11-21 14:07:13,911 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-11-21 14:07:13,912 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-21 14:07:13,915 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:13,917 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 14:07:13,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,946 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,946 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,946 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,947 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,948 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,950 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,952 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:13,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:13,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:13,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,963 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,963 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,964 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,964 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,964 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,964 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,964 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,965 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,965 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,965 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,965 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,965 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,966 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,966 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,967 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,967 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,967 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:13,967 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,968 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,982 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:13,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,999 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:13,999 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,002 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,002 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,002 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,005 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,011 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,011 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,012 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,012 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,012 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,012 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,014 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,017 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,018 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,021 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,021 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,022 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,022 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,023 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,023 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:07:14 BoogieIcfgContainer [2022-11-21 14:07:14,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 14:07:14,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 14:07:14,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 14:07:14,038 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 14:07:14,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:01:15" (3/4) ... [2022-11-21 14:07:14,042 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 14:07:14,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2022-11-21 14:07:14,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-21 14:07:14,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-21 14:07:14,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 14:07:14,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 14:07:14,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 14:07:14,088 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && list == #memory_$Pointer$[n][n]) || (((#memory_$Pointer$[x][x + 4] == 0 && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && 0 == #memory_$Pointer$[x][x + 4]) && ((#memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x] && #memory_$Pointer$[x][x] == #memory_$Pointer$[x][x + 4]) || (#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])))) && x == 0) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 : int :: (#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][0] == 0 && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 == 0)) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][4] == 0)) || (((((((((((((((((((((((list == #memory_$Pointer$[x][x] && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][x + 4] == 0) && \valid[list] == 1) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && !(#memory_$Pointer$[list][list + 4] == 0)) && \valid[x] == 1) && list == x) && n + 2 <= list) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && tail == 0) && !(tail == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && 2 + x <= #memory_$Pointer$[x][x]) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 : int :: ((((v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == 0)) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 <= #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]) && #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] == 0) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0] == 0)) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) [2022-11-21 14:07:14,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 14:07:14,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 14:07:14,112 INFO L158 Benchmark]: Toolchain (without parser) took 360071.18ms. Allocated memory was 136.3MB in the beginning and 400.6MB in the end (delta: 264.2MB). Free memory was 91.7MB in the beginning and 247.5MB in the end (delta: -155.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,112 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:07:14,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.79ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 74.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.15ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 72.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,119 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 70.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,120 INFO L158 Benchmark]: RCFGBuilder took 543.88ms. Allocated memory is still 136.3MB. Free memory was 70.7MB in the beginning and 54.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,120 INFO L158 Benchmark]: TraceAbstraction took 358737.15ms. Allocated memory was 136.3MB in the beginning and 400.6MB in the end (delta: 264.2MB). Free memory was 106.4MB in the beginning and 251.7MB in the end (delta: -145.3MB). Peak memory consumption was 242.2MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,121 INFO L158 Benchmark]: Witness Printer took 71.54ms. Allocated memory is still 400.6MB. Free memory was 251.7MB in the beginning and 247.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 14:07:14,122 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.29ms. Allocated memory is still 136.3MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.79ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 74.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.15ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 72.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 70.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.88ms. Allocated memory is still 136.3MB. Free memory was 70.7MB in the beginning and 54.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 358737.15ms. Allocated memory was 136.3MB in the beginning and 400.6MB in the end (delta: 264.2MB). Free memory was 106.4MB in the beginning and 251.7MB in the end (delta: -145.3MB). Peak memory consumption was 242.2MB. Max. memory is 16.1GB. * Witness Printer took 71.54ms. Allocated memory is still 400.6MB. Free memory was 251.7MB in the beginning and 247.5MB in the end (delta: 4.2MB). 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.offset - 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_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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_main_~x~0#1.base_BEFORE_CALL_31,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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_main_~x~0#1.base_BEFORE_CALL_34,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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.offset - 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_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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_main_~x~0#1.base_BEFORE_CALL_31,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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_main_~x~0#1.base_BEFORE_CALL_34,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$.offset * 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: 20]: 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 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 358.5s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 159.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 2460 SdHoareTripleChecker+Valid, 71.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2450 mSDsluCounter, 6870 SdHoareTripleChecker+Invalid, 70.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 137 IncrementalHoareTripleChecker+Unchecked, 5882 mSDsCounter, 1009 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6409 IncrementalHoareTripleChecker+Invalid, 7586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1009 mSolverCounterUnsat, 988 mSDtfsCounter, 6409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1447 GetRequests, 897 SyntacticMatches, 18 SemanticMatches, 532 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5283 ImplicationChecksByTransitivity, 223.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 370 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 181 PreInvPairs, 199 NumberOfFragments, 1991 HoareAnnotationTreeSize, 181 FomulaSimplifications, 1444 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 10 FomulaSimplificationsInter, 164735 FormulaSimplificationTreeSizeReductionInter, 37.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 154.5s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1551 ConstructedInterpolants, 163 QuantifiedInterpolants, 18081 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3525 ConjunctsInSsa, 694 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 679/875 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: 601]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 607]: Loop Invariant [2022-11-21 14:07:14,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,167 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,172 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-21 14:07:14,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 14:07:14,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,200 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-21 14:07:14,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 14:07:14,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && list == #memory_$Pointer$[n][n]) || (((#memory_$Pointer$[x][x + 4] == 0 && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && 0 == #memory_$Pointer$[x][x + 4]) && ((#memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x] && #memory_$Pointer$[x][x] == #memory_$Pointer$[x][x + 4]) || (#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])))) && x == 0) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 : int :: (#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][0] == 0 && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 == 0)) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][4] == 0)) || (((((((((((((((((((((((list == #memory_$Pointer$[x][x] && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][x + 4] == 0) && \valid[list] == 1) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && !(#memory_$Pointer$[list][list + 4] == 0)) && \valid[x] == 1) && list == x) && n + 2 <= list) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && tail == 0) && !(tail == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && 2 + x <= #memory_$Pointer$[x][x]) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 : int :: ((((v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == 0)) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 <= #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]) && #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] == 0) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0] == 0)) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) RESULT: Ultimate proved your program to be correct! [2022-11-21 14:07:14,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25bd5369-c43e-4a52-a7ef-b0b6cb836cf6/bin/uautomizer-vX5HgA9Q3a/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