./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:58:23,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:58:23,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:58:23,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:58:23,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:58:23,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:58:23,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:58:23,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:58:23,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:58:23,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:58:23,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:58:23,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:58:23,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:58:23,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:58:23,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:58:23,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:58:23,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:58:23,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:58:23,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:58:23,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:58:23,953 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:58:23,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:58:23,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:58:23,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:58:23,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:58:23,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:58:23,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:58:23,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:58:23,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:58:23,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:58:23,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:58:23,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:58:23,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:58:23,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:58:23,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:58:23,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:58:23,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:58:23,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:58:23,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:58:23,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:58:23,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:58:23,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:58:23,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:58:24,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:58:24,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:58:24,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:58:24,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:58:24,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:58:24,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:58:24,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:58:24,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:58:24,008 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:58:24,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:58:24,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:58:24,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:58:24,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:58:24,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:58:24,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:58:24,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:58:24,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:58:24,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:58:24,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:58:24,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:58:24,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:58:24,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:58:24,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:58:24,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:58:24,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:24,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:58:24,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:58:24,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:58:24,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:58:24,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:58:24,014 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:58:24,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:58:24,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:58:24,014 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-21 01:58:24,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:58:24,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:58:24,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:58:24,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:58:24,321 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:58:24,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-21 01:58:24,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990f41c9d/b021bcc082fc430e9d072b969a2cccad/FLAG7437c6807 [2022-07-21 01:58:24,733 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:58:24,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-21 01:58:24,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990f41c9d/b021bcc082fc430e9d072b969a2cccad/FLAG7437c6807 [2022-07-21 01:58:24,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990f41c9d/b021bcc082fc430e9d072b969a2cccad [2022-07-21 01:58:24,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:58:24,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:58:24,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:24,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:58:24,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:58:24,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:24" (1/1) ... [2022-07-21 01:58:24,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd3d029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:24, skipping insertion in model container [2022-07-21 01:58:24,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:24" (1/1) ... [2022-07-21 01:58:24,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:58:24,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:24,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-21 01:58:25,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:25,039 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:58:25,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-21 01:58:25,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:25,107 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:58:25,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25 WrapperNode [2022-07-21 01:58:25,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:25,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:25,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:58:25,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:58:25,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,161 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-21 01:58:25,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:25,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:58:25,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:58:25,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:58:25,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:58:25,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:58:25,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:58:25,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:58:25,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (1/1) ... [2022-07-21 01:58:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:25,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 01:58:25,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 01:58:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-21 01:58:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-21 01:58:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 01:58:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:58:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:58:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:58:25,426 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:58:25,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:58:25,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:58:25,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:58:25,670 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:58:25,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:25 BoogieIcfgContainer [2022-07-21 01:58:25,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:58:25,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:58:25,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:58:25,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:58:25,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:58:24" (1/3) ... [2022-07-21 01:58:25,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ee9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:25, skipping insertion in model container [2022-07-21 01:58:25,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:25" (2/3) ... [2022-07-21 01:58:25,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ee9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:25, skipping insertion in model container [2022-07-21 01:58:25,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:25" (3/3) ... [2022-07-21 01:58:25,677 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-21 01:58:25,687 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:58:25,688 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:58:25,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:58:25,731 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e847b83, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f9f81e9 [2022-07-21 01:58:25,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:58:25,734 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-07-21 01:58:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:58:25,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:25,740 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-07-21 01:58:25,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-07-21 01:58:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:25,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417328390] [2022-07-21 01:58:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:58:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:25,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417328390] [2022-07-21 01:58:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417328390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:25,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:25,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:58:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708195760] [2022-07-21 01:58:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:25,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:58:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:58:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:25,946 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-07-21 01:58:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:25,966 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-07-21 01:58:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:58:25,967 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-07-21 01:58:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:25,973 INFO L225 Difference]: With dead ends: 77 [2022-07-21 01:58:25,973 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 01:58:25,976 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-07-21 01:58:25,982 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-07-21 01:58:25,983 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-07-21 01:58:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 01:58:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-21 01:58:26,012 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-07-21 01:58:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-07-21 01:58:26,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-07-21 01:58:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:26,016 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-21 01:58:26,016 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-07-21 01:58:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-07-21 01:58:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:58:26,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:26,020 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-07-21 01:58:26,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:58:26,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-07-21 01:58:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:26,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612477611] [2022-07-21 01:58:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:58:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:26,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612477611] [2022-07-21 01:58:26,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612477611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:26,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:26,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042531406] [2022-07-21 01:58:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:26,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:26,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:26,159 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-07-21 01:58:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:26,227 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-21 01:58:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:58:26,227 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-07-21 01:58:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:26,228 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:58:26,228 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 01:58:26,228 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-07-21 01:58:26,229 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-07-21 01:58:26,230 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-07-21 01:58:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 01:58:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-21 01:58:26,234 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-07-21 01:58:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-21 01:58:26,235 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-07-21 01:58:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:26,235 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-21 01:58:26,236 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-07-21 01:58:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-21 01:58:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 01:58:26,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:26,236 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-07-21 01:58:26,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:58:26,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-07-21 01:58:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:26,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615185869] [2022-07-21 01:58:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 01:58:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:58:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:26,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615185869] [2022-07-21 01:58:26,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615185869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:26,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:26,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:58:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754812142] [2022-07-21 01:58:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:26,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:58:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:58:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:58:26,306 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-07-21 01:58:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:26,347 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-07-21 01:58:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:26,347 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-07-21 01:58:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:26,348 INFO L225 Difference]: With dead ends: 86 [2022-07-21 01:58:26,348 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 01:58:26,348 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-07-21 01:58:26,349 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:26,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:58:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 01:58:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-07-21 01:58:26,355 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-07-21 01:58:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-07-21 01:58:26,356 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-07-21 01:58:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:26,356 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-07-21 01:58:26,356 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-07-21 01:58:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-07-21 01:58:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 01:58:26,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:26,357 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-07-21 01:58:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:58:26,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-07-21 01:58:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:26,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298280640] [2022-07-21 01:58:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 01:58:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:58:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298280640] [2022-07-21 01:58:26,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298280640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802061558] [2022-07-21 01:58:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:26,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:26,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:26,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 01:58:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 01:58:26,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:58:26,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:58:26,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802061558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:26,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:26,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-21 01:58:26,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846424441] [2022-07-21 01:58:26,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:26,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 01:58:26,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 01:58:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:58:26,762 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-07-21 01:58:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:26,998 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-07-21 01:58:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:26,999 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-07-21 01:58:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:27,006 INFO L225 Difference]: With dead ends: 118 [2022-07-21 01:58:27,006 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 01:58:27,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-21 01:58:27,015 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:27,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 01:58:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 01:58:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-07-21 01:58:27,027 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-07-21 01:58:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-07-21 01:58:27,028 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-07-21 01:58:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:27,028 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-07-21 01:58:27,028 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-07-21 01:58:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-07-21 01:58:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 01:58:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:27,029 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-07-21 01:58:27,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:27,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-07-21 01:58:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:27,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987299717] [2022-07-21 01:58:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 01:58:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:58:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987299717] [2022-07-21 01:58:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987299717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:27,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:27,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:58:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986194365] [2022-07-21 01:58:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:27,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:58:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:58:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:58:27,337 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-07-21 01:58:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:27,391 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-07-21 01:58:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:58:27,392 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-07-21 01:58:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:27,393 INFO L225 Difference]: With dead ends: 75 [2022-07-21 01:58:27,393 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 01:58:27,393 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-07-21 01:58:27,394 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:27,394 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.0s Time] [2022-07-21 01:58:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 01:58:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-21 01:58:27,418 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-07-21 01:58:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-07-21 01:58:27,421 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-07-21 01:58:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:27,422 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-07-21 01:58:27,422 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-07-21 01:58:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-07-21 01:58:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 01:58:27,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:27,435 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-07-21 01:58:27,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 01:58:27,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-07-21 01:58:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:27,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600647488] [2022-07-21 01:58:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 01:58:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 01:58:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:27,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600647488] [2022-07-21 01:58:27,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600647488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:27,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105635600] [2022-07-21 01:58:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:27,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:27,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 01:58:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 01:58:27,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:27,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:27,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:27,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:27,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:27,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 01:58:27,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:27,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 01:58:27,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 01:58:27,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 01:58:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:58:27,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:27,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 01:58:28,027 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:58:28,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-21 01:58:28,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-21 01:58:28,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 01:58:28,045 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-07-21 01:58:28,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-21 01:58:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 01:58:28,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105635600] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:28,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:28,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-07-21 01:58:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651189278] [2022-07-21 01:58:28,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:28,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 01:58:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 01:58:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:58:28,066 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-07-21 01:58:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:28,529 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2022-07-21 01:58:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 01:58:28,531 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-07-21 01:58:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:28,534 INFO L225 Difference]: With dead ends: 269 [2022-07-21 01:58:28,534 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 01:58:28,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-07-21 01:58:28,539 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 193 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:28,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 881 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 381 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-07-21 01:58:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 01:58:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 90. [2022-07-21 01:58:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 74 states have internal predecessors, (92), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-21 01:58:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-07-21 01:58:28,568 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 37 [2022-07-21 01:58:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:28,569 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-07-21 01:58:28,570 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-07-21 01:58:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-07-21 01:58:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 01:58:28,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:28,571 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-07-21 01:58:28,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:28,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-21 01:58:28,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-07-21 01:58:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709362579] [2022-07-21 01:58:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 01:58:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:58:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:28,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709362579] [2022-07-21 01:58:28,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709362579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:28,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:28,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5889733] [2022-07-21 01:58:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:28,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:28,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:28,875 INFO L87 Difference]: Start difference. First operand 90 states and 125 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-07-21 01:58:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:28,955 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-07-21 01:58:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:28,955 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-07-21 01:58:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:28,956 INFO L225 Difference]: With dead ends: 133 [2022-07-21 01:58:28,956 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 01:58:28,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:58:28,957 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:28,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 165 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:58:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 01:58:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-21 01:58:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 76 states have internal predecessors, (94), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-21 01:58:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2022-07-21 01:58:28,966 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 35 [2022-07-21 01:58:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2022-07-21 01:58:28,966 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-07-21 01:58:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2022-07-21 01:58:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 01:58:28,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:28,967 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-07-21 01:58:28,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 01:58:28,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-07-21 01:58:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:28,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017776582] [2022-07-21 01:58:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 01:58:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 01:58:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017776582] [2022-07-21 01:58:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017776582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:29,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:29,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019813645] [2022-07-21 01:58:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:29,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:29,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:29,019 INFO L87 Difference]: Start difference. First operand 92 states and 127 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-07-21 01:58:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:29,074 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-07-21 01:58:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:58:29,075 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-07-21 01:58:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:29,075 INFO L225 Difference]: With dead ends: 99 [2022-07-21 01:58:29,076 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 01:58:29,076 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-07-21 01:58:29,076 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-07-21 01:58:29,076 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-07-21 01:58:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 01:58:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-21 01:58:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-21 01:58:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-07-21 01:58:29,083 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 35 [2022-07-21 01:58:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:29,083 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-07-21 01:58:29,083 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-07-21 01:58:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-07-21 01:58:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 01:58:29,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:29,084 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-07-21 01:58:29,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 01:58:29,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-07-21 01:58:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686690792] [2022-07-21 01:58:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 01:58:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:58:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686690792] [2022-07-21 01:58:29,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686690792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:29,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:29,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:29,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741242871] [2022-07-21 01:58:29,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:29,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:29,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:29,140 INFO L87 Difference]: Start difference. First operand 80 states and 109 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-07-21 01:58:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:29,184 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-21 01:58:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:29,184 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-07-21 01:58:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:29,185 INFO L225 Difference]: With dead ends: 130 [2022-07-21 01:58:29,185 INFO L226 Difference]: Without dead ends: 62 [2022-07-21 01:58:29,186 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-07-21 01:58:29,186 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-07-21 01:58:29,186 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-07-21 01:58:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-21 01:58:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-07-21 01:58:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-21 01:58:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-07-21 01:58:29,192 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 36 [2022-07-21 01:58:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:29,192 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-07-21 01:58:29,192 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-07-21 01:58:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-07-21 01:58:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 01:58:29,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:29,193 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-07-21 01:58:29,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 01:58:29,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash -827934680, now seen corresponding path program 1 times [2022-07-21 01:58:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:29,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276598366] [2022-07-21 01:58:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 01:58:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 01:58:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 01:58:29,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276598366] [2022-07-21 01:58:29,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276598366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299522440] [2022-07-21 01:58:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:29,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:29,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 01:58:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-21 01:58:29,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:29,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 01:58:29,521 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:29,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 01:58:29,553 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-21 01:58:29,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 01:58:29,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 01:58:29,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-21 01:58:29,618 INFO L356 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-07-21 01:58:29,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 46 [2022-07-21 01:58:29,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-21 01:58:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 01:58:29,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:29,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:29,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2022-07-21 01:58:29,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-07-21 01:58:29,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-07-21 01:58:29,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 01:58:29,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-21 01:58:29,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 01:58:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 01:58:29,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299522440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:29,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:29,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2022-07-21 01:58:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737574212] [2022-07-21 01:58:29,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:29,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 01:58:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 01:58:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-21 01:58:29,940 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 01:58:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:30,348 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2022-07-21 01:58:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 01:58:30,348 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2022-07-21 01:58:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:30,349 INFO L225 Difference]: With dead ends: 172 [2022-07-21 01:58:30,349 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 01:58:30,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-07-21 01:58:30,350 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 123 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:30,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 517 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 480 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-07-21 01:58:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 01:58:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-07-21 01:58:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 69 states have internal predecessors, (88), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2022-07-21 01:58:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2022-07-21 01:58:30,361 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 46 [2022-07-21 01:58:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:30,361 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2022-07-21 01:58:30,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 01:58:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2022-07-21 01:58:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 01:58:30,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:30,362 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-07-21 01:58:30,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 01:58:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:30,580 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-07-21 01:58:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756473234] [2022-07-21 01:58:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 01:58:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756473234] [2022-07-21 01:58:30,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756473234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337525312] [2022-07-21 01:58:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:30,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:30,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 01:58:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-21 01:58:30,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:31,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 01:58:31,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 01:58:31,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 01:58:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 01:58:31,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:31,528 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 01:58:31,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 52 [2022-07-21 01:58:31,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:31,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-07-21 01:58:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 01:58:34,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:34,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 01:58:34,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 01:58:34,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:34,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:34,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 174 [2022-07-21 01:58:34,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:34,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:34,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 109 [2022-07-21 01:58:34,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:34,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 700 treesize of output 686 [2022-07-21 01:58:34,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:34,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 876 treesize of output 822 [2022-07-21 01:58:34,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 814 treesize of output 792 [2022-07-21 01:58:34,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:34,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:34,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 986 treesize of output 872 [2022-07-21 01:58:36,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 01:58:36,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 01:58:36,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-21 01:58:37,074 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-07-21 01:58:37,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 222 [2022-07-21 01:58:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 01:58:37,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337525312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:37,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:37,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-07-21 01:58:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724923177] [2022-07-21 01:58:37,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:37,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 01:58:37,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 01:58:37,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1559, Unknown=6, NotChecked=0, Total=1722 [2022-07-21 01:58:37,661 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:58:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:41,897 INFO L93 Difference]: Finished difference Result 272 states and 405 transitions. [2022-07-21 01:58:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 01:58:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Word has length 43 [2022-07-21 01:58:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:41,909 INFO L225 Difference]: With dead ends: 272 [2022-07-21 01:58:41,909 INFO L226 Difference]: Without dead ends: 199 [2022-07-21 01:58:41,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=481, Invalid=4065, Unknown=10, NotChecked=0, Total=4556 [2022-07-21 01:58:41,912 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 379 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:41,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1353 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1476 Invalid, 0 Unknown, 383 Unchecked, 1.2s Time] [2022-07-21 01:58:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-21 01:58:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2022-07-21 01:58:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 89 states have internal predecessors, (107), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-21 01:58:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2022-07-21 01:58:41,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 43 [2022-07-21 01:58:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:41,931 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2022-07-21 01:58:41,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:58:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2022-07-21 01:58:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 01:58:41,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:41,933 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-07-21 01:58:41,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:42,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:42,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1251374562, now seen corresponding path program 1 times [2022-07-21 01:58:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:42,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392954712] [2022-07-21 01:58:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 01:58:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:42,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392954712] [2022-07-21 01:58:42,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392954712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:42,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:42,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:58:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495043836] [2022-07-21 01:58:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:42,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:58:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:58:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:58:42,216 INFO L87 Difference]: Start difference. First operand 110 states and 153 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-07-21 01:58:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:42,260 INFO L93 Difference]: Finished difference Result 134 states and 189 transitions. [2022-07-21 01:58:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:58:42,260 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-07-21 01:58:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:42,262 INFO L225 Difference]: With dead ends: 134 [2022-07-21 01:58:42,262 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 01:58:42,262 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-07-21 01:58:42,263 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 331 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-07-21 01:58:42,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 331 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:58:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 01:58:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2022-07-21 01:58:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 91 states have internal predecessors, (109), 16 states have call successors, (16), 6 states have call predecessors, (16), 12 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-21 01:58:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2022-07-21 01:58:42,274 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 44 [2022-07-21 01:58:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:42,274 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2022-07-21 01:58:42,274 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-07-21 01:58:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2022-07-21 01:58:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 01:58:42,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:42,275 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-07-21 01:58:42,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 01:58:42,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash -13848694, now seen corresponding path program 1 times [2022-07-21 01:58:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:42,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113542614] [2022-07-21 01:58:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 01:58:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:42,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113542614] [2022-07-21 01:58:42,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113542614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:42,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299178095] [2022-07-21 01:58:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:42,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:42,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 01:58:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 01:58:42,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:42,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:42,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 01:58:42,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 01:58:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 01:58:42,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:42,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 01:58:42,908 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:58:42,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 01:58:42,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 01:58:42,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-21 01:58:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 01:58:42,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299178095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:42,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:42,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2022-07-21 01:58:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577328278] [2022-07-21 01:58:42,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:42,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 01:58:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 01:58:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-07-21 01:58:42,973 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-21 01:58:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:44,233 INFO L93 Difference]: Finished difference Result 238 states and 355 transitions. [2022-07-21 01:58:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 01:58:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 43 [2022-07-21 01:58:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:44,234 INFO L225 Difference]: With dead ends: 238 [2022-07-21 01:58:44,234 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 01:58:44,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=415, Invalid=2237, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 01:58:44,236 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 315 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:44,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 937 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 895 Invalid, 0 Unknown, 76 Unchecked, 0.5s Time] [2022-07-21 01:58:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 01:58:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2022-07-21 01:58:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 111 states have internal predecessors, (131), 22 states have call successors, (22), 9 states have call predecessors, (22), 14 states have return successors, (49), 20 states have call predecessors, (49), 20 states have call successors, (49) [2022-07-21 01:58:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2022-07-21 01:58:44,248 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 43 [2022-07-21 01:58:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:44,248 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2022-07-21 01:58:44,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-21 01:58:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2022-07-21 01:58:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 01:58:44,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:44,249 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:44,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:44,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 01:58:44,466 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1248112818, now seen corresponding path program 2 times [2022-07-21 01:58:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:44,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964887151] [2022-07-21 01:58:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:58:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 01:58:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 01:58:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964887151] [2022-07-21 01:58:44,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964887151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098712138] [2022-07-21 01:58:44,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:58:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:44,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:44,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:44,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 01:58:44,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:58:44,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:58:44,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-21 01:58:44,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:44,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 01:58:45,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:45,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:45,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:45,036 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 01:58:45,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-21 01:58:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:45,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 01:58:45,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:45,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:45,067 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 01:58:45,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-21 01:58:45,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 01:58:45,185 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 01:58:45,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 01:58:45,256 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 01:58:45,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-21 01:58:45,276 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 01:58:45,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-21 01:58:45,353 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:45,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 01:58:45,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:45,399 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 01:58:45,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 50 [2022-07-21 01:58:45,420 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 01:58:45,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-21 01:58:45,438 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 01:58:45,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 53 [2022-07-21 01:58:45,464 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:58:45,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 01:58:46,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:46,826 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:58:46,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 26 [2022-07-21 01:58:46,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:46,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 15 [2022-07-21 01:58:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 01:58:46,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:46,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 01:58:47,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:47,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:47,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-21 01:58:47,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:47,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 284 treesize of output 262 [2022-07-21 01:58:47,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2022-07-21 01:58:47,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2022-07-21 01:58:47,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2022-07-21 01:58:47,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:47,509 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-21 01:58:47,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-21 01:58:47,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 01:58:47,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:47,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-21 01:58:47,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:47,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-07-21 01:58:47,588 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 01:58:47,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2022-07-21 01:58:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 01:58:47,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098712138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:47,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:47,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 33 [2022-07-21 01:58:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116318830] [2022-07-21 01:58:47,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:47,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 01:58:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:47,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 01:58:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=899, Unknown=5, NotChecked=0, Total=1056 [2022-07-21 01:58:47,595 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 01:58:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:50,442 INFO L93 Difference]: Finished difference Result 255 states and 358 transitions. [2022-07-21 01:58:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 01:58:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2022-07-21 01:58:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:50,444 INFO L225 Difference]: With dead ends: 255 [2022-07-21 01:58:50,444 INFO L226 Difference]: Without dead ends: 214 [2022-07-21 01:58:50,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=357, Invalid=1707, Unknown=6, NotChecked=0, Total=2070 [2022-07-21 01:58:50,445 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 147 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:50,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 788 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 387 Invalid, 0 Unknown, 331 Unchecked, 0.3s Time] [2022-07-21 01:58:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-21 01:58:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2022-07-21 01:58:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 130 states have internal predecessors, (151), 23 states have call successors, (23), 12 states have call predecessors, (23), 19 states have return successors, (51), 22 states have call predecessors, (51), 21 states have call successors, (51) [2022-07-21 01:58:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 225 transitions. [2022-07-21 01:58:50,463 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 225 transitions. Word has length 49 [2022-07-21 01:58:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:50,463 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-07-21 01:58:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 01:58:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 225 transitions. [2022-07-21 01:58:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 01:58:50,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:50,464 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-07-21 01:58:50,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:50,679 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-07-21 01:58:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:50,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995750252] [2022-07-21 01:58:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 01:58:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 01:58:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995750252] [2022-07-21 01:58:50,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995750252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:50,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462604410] [2022-07-21 01:58:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:50,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:50,760 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:50,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 01:58:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:50,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 01:58:50,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 01:58:50,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 01:58:50,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462604410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:50,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:50,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-21 01:58:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029557857] [2022-07-21 01:58:50,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:50,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:58:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:58:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:58:50,942 INFO L87 Difference]: Start difference. First operand 165 states and 225 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-07-21 01:58:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:51,067 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2022-07-21 01:58:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:58:51,068 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-07-21 01:58:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:51,069 INFO L225 Difference]: With dead ends: 227 [2022-07-21 01:58:51,069 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 01:58:51,070 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-07-21 01:58:51,071 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 121 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:51,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 148 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:58:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 01:58:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-07-21 01:58:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 118 states have internal predecessors, (134), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (47), 21 states have call predecessors, (47), 19 states have call successors, (47) [2022-07-21 01:58:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2022-07-21 01:58:51,085 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 46 [2022-07-21 01:58:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:51,086 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2022-07-21 01:58:51,086 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-07-21 01:58:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2022-07-21 01:58:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 01:58:51,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:51,087 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-07-21 01:58:51,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:51,301 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2022-07-21 01:58:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:51,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663074825] [2022-07-21 01:58:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 01:58:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 01:58:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 01:58:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 01:58:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663074825] [2022-07-21 01:58:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663074825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714621609] [2022-07-21 01:58:51,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:58:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:51,565 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:58:51,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 01:58:51,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:58:51,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:58:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-21 01:58:51,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:51,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:51,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:51,736 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 01:58:51,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-07-21 01:58:51,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 01:58:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:51,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 01:58:51,755 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 01:58:51,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 01:58:51,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 01:58:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:51,984 INFO L356 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-07-21 01:58:51,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 82 [2022-07-21 01:58:51,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:52,013 INFO L356 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2022-07-21 01:58:52,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2022-07-21 01:59:06,594 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:16,683 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:28,585 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:34,137 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:40,267 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 01:59:40,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714621609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:40,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:40,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-07-21 01:59:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681736194] [2022-07-21 01:59:40,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 01:59:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 01:59:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=997, Unknown=7, NotChecked=0, Total=1122 [2022-07-21 01:59:40,560 INFO L87 Difference]: Start difference. First operand 152 states and 202 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-07-21 01:59:53,447 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:59:59,485 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 02:00:10,169 WARN L233 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 65 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 02:00:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:10,260 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2022-07-21 02:00:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 02:00:10,262 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-07-21 02:00:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:10,263 INFO L225 Difference]: With dead ends: 244 [2022-07-21 02:00:10,263 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 02:00:10,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 77.8s TimeCoverageRelationStatistics Valid=284, Invalid=2056, Unknown=12, NotChecked=0, Total=2352 [2022-07-21 02:00:10,264 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:10,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 407 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-07-21 02:00:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 02:00:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2022-07-21 02:00:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 15 states have call successors, (15), 11 states have call predecessors, (15), 13 states have return successors, (25), 14 states have call predecessors, (25), 14 states have call successors, (25) [2022-07-21 02:00:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-07-21 02:00:10,277 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 50 [2022-07-21 02:00:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-07-21 02:00:10,278 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-07-21 02:00:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-07-21 02:00:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 02:00:10,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:10,279 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-07-21 02:00:10,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 02:00:10,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-07-21 02:00:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:10,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655471389] [2022-07-21 02:00:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:00:10,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655471389] [2022-07-21 02:00:10,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655471389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857785324] [2022-07-21 02:00:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:10,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:10,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:10,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:10,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 02:00:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 02:00:10,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:11,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:00:11,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:11,316 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:00:11,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-07-21 02:00:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:00:11,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:11,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-07-21 02:00:11,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:00:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 02:00:11,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:11,642 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1302 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) v_ArrVal_1302) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0))) is different from false [2022-07-21 02:00:11,661 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (forall ((v_ArrVal_1302 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1302) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0))) is different from false [2022-07-21 02:00:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857785324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:11,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:11,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-07-21 02:00:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677367551] [2022-07-21 02:00:11,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 02:00:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 02:00:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=402, Unknown=2, NotChecked=82, Total=552 [2022-07-21 02:00:11,684 INFO L87 Difference]: Start difference. First operand 125 states and 152 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-07-21 02:00:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:12,838 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2022-07-21 02:00:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 02:00:12,839 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-07-21 02:00:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:12,840 INFO L225 Difference]: With dead ends: 167 [2022-07-21 02:00:12,840 INFO L226 Difference]: Without dead ends: 142 [2022-07-21 02:00:12,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=1266, Unknown=2, NotChecked=154, Total=1722 [2022-07-21 02:00:12,841 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 155 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:12,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 437 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 398 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-21 02:00:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-21 02:00:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2022-07-21 02:00:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 99 states have internal predecessors, (110), 15 states have call successors, (15), 11 states have call predecessors, (15), 13 states have return successors, (25), 14 states have call predecessors, (25), 14 states have call successors, (25) [2022-07-21 02:00:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2022-07-21 02:00:12,859 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 53 [2022-07-21 02:00:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:12,863 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2022-07-21 02:00:12,863 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-07-21 02:00:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-07-21 02:00:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 02:00:12,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:12,864 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-07-21 02:00:12,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:13,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 02:00:13,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-07-21 02:00:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:13,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922376253] [2022-07-21 02:00:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:00:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922376253] [2022-07-21 02:00:13,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922376253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193484092] [2022-07-21 02:00:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:13,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:13,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:13,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 02:00:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:13,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-21 02:00:13,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:13,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:13,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:13,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:13,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:13,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:13,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:13,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:13,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:13,903 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:00:13,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-21 02:00:13,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:13,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-07-21 02:00:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:14,404 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 02:00:14,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:14,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2022-07-21 02:00:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:00:19,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:20,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193484092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:20,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:20,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-07-21 02:00:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911516619] [2022-07-21 02:00:20,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:20,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 02:00:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 02:00:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1463, Unknown=11, NotChecked=0, Total=1640 [2022-07-21 02:00:20,028 INFO L87 Difference]: Start difference. First operand 125 states and 150 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-07-21 02:00:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:22,779 INFO L93 Difference]: Finished difference Result 215 states and 257 transitions. [2022-07-21 02:00:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 02:00:22,780 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-07-21 02:00:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:22,782 INFO L225 Difference]: With dead ends: 215 [2022-07-21 02:00:22,782 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 02:00:22,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=390, Invalid=2901, Unknown=15, NotChecked=0, Total=3306 [2022-07-21 02:00:22,783 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 120 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:22,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 557 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 326 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-07-21 02:00:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 02:00:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 199. [2022-07-21 02:00:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.103225806451613) internal successors, (171), 158 states have internal predecessors, (171), 23 states have call successors, (23), 16 states have call predecessors, (23), 20 states have return successors, (41), 24 states have call predecessors, (41), 22 states have call successors, (41) [2022-07-21 02:00:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2022-07-21 02:00:22,810 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 53 [2022-07-21 02:00:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:22,810 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2022-07-21 02:00:22,810 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-07-21 02:00:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2022-07-21 02:00:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 02:00:22,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:22,811 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-07-21 02:00:22,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:23,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 02:00:23,023 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-07-21 02:00:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001655137] [2022-07-21 02:00:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 02:00:23,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001655137] [2022-07-21 02:00:23,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001655137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535431974] [2022-07-21 02:00:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:23,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:23,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:23,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:23,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 02:00:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:23,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 02:00:23,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:23,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:23,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 02:00:23,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:23,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:23,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:23,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-07-21 02:00:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:23,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2022-07-21 02:00:23,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 02:00:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:00:23,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:23,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:23,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2022-07-21 02:00:23,907 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 02:00:23,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 02:00:23,910 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:00:23,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-07-21 02:00:23,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-21 02:00:23,943 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 02:00:23,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-21 02:00:23,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:23,948 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:00:23,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2022-07-21 02:00:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 02:00:24,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535431974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:00:24,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:00:24,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 27 [2022-07-21 02:00:24,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74804691] [2022-07-21 02:00:24,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:24,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 02:00:24,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:24,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 02:00:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-21 02:00:24,005 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-21 02:00:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:24,537 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-07-21 02:00:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 02:00:24,539 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 53 [2022-07-21 02:00:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:24,541 INFO L225 Difference]: With dead ends: 223 [2022-07-21 02:00:24,541 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 02:00:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 02:00:24,542 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 71 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:24,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 426 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-21 02:00:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 02:00:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 122. [2022-07-21 02:00:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 96 states have internal predecessors, (105), 13 states have call successors, (13), 12 states have call predecessors, (13), 15 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-21 02:00:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2022-07-21 02:00:24,556 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 53 [2022-07-21 02:00:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2022-07-21 02:00:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-21 02:00:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2022-07-21 02:00:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 02:00:24,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:24,558 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-07-21 02:00:24,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:24,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:24,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-07-21 02:00:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:24,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4191161] [2022-07-21 02:00:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 02:00:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:24,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4191161] [2022-07-21 02:00:24,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4191161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:00:24,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:00:24,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 02:00:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497949126] [2022-07-21 02:00:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:00:24,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:00:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:24,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:00:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:00:24,865 INFO L87 Difference]: Start difference. First operand 122 states and 142 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-07-21 02:00:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:24,896 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-07-21 02:00:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:00:24,896 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-07-21 02:00:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:24,898 INFO L225 Difference]: With dead ends: 132 [2022-07-21 02:00:24,898 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 02:00:24,898 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-07-21 02:00:24,899 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-07-21 02:00:24,899 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-07-21 02:00:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 02:00:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-07-21 02:00:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.120879120879121) internal successors, (102), 95 states have internal predecessors, (102), 13 states have call successors, (13), 11 states have call predecessors, (13), 15 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-21 02:00:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-07-21 02:00:24,914 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 59 [2022-07-21 02:00:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:24,915 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-07-21 02:00:24,917 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-07-21 02:00:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-07-21 02:00:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 02:00:24,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:24,918 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-07-21 02:00:24,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 02:00:24,919 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-07-21 02:00:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:24,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282959883] [2022-07-21 02:00:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 02:00:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282959883] [2022-07-21 02:00:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282959883] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570089740] [2022-07-21 02:00:25,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:00:25,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:25,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:25,178 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:25,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 02:00:25,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-21 02:00:25,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:00:25,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 108 conjunts are in the unsatisfiable core [2022-07-21 02:00:25,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:25,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:25,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:00:25,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:25,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:25,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:25,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:00:25,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:25,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 02:00:25,795 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:00:25,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-21 02:00:25,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:25,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-07-21 02:00:26,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:26,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:26,204 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 02:00:26,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2022-07-21 02:00:26,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:26,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:26,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-07-21 02:00:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:00:26,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570089740] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:27,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:27,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2022-07-21 02:00:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716466982] [2022-07-21 02:00:27,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 02:00:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 02:00:27,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2022-07-21 02:00:27,332 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-21 02:00:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:27,917 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2022-07-21 02:00:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 02:00:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) Word has length 60 [2022-07-21 02:00:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:27,918 INFO L225 Difference]: With dead ends: 136 [2022-07-21 02:00:27,918 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 02:00:27,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2022-07-21 02:00:27,919 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:27,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 457 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-07-21 02:00:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 02:00:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2022-07-21 02:00:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.118279569892473) internal successors, (104), 97 states have internal predecessors, (104), 13 states have call successors, (13), 11 states have call predecessors, (13), 16 states have return successors, (25), 14 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-21 02:00:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2022-07-21 02:00:27,933 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 60 [2022-07-21 02:00:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:27,933 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2022-07-21 02:00:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-21 02:00:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-07-21 02:00:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 02:00:27,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:27,934 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:27,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 02:00:28,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 02:00:28,149 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2093349375, now seen corresponding path program 1 times [2022-07-21 02:00:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:28,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098734531] [2022-07-21 02:00:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 02:00:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 02:00:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 02:00:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 02:00:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098734531] [2022-07-21 02:00:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098734531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057918187] [2022-07-21 02:00:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:28,202 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 02:00:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 02:00:28,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 02:00:28,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:00:28,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057918187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:00:28,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:00:28,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-07-21 02:00:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381748527] [2022-07-21 02:00:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:00:28,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:00:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:00:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:00:28,361 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 02:00:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:28,390 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-07-21 02:00:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:00:28,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-21 02:00:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:28,391 INFO L225 Difference]: With dead ends: 140 [2022-07-21 02:00:28,391 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 02:00:28,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:00:28,393 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:28,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 219 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:00:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 02:00:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-07-21 02:00:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 67 states have internal predecessors, (74), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-21 02:00:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-07-21 02:00:28,402 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 68 [2022-07-21 02:00:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:28,402 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-07-21 02:00:28,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 02:00:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-07-21 02:00:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 02:00:28,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:28,403 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-07-21 02:00:28,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-21 02:00:28,615 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1013838843, now seen corresponding path program 4 times [2022-07-21 02:00:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:28,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51652253] [2022-07-21 02:00:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:00:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:00:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:00:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:00:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:00:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 02:00:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51652253] [2022-07-21 02:00:28,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51652253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219395825] [2022-07-21 02:00:28,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 02:00:28,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:28,912 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 02:00:29,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 02:00:29,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:00:29,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-21 02:00:29,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:29,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:29,112 INFO L356 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2022-07-21 02:00:29,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 36 [2022-07-21 02:00:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:29,134 INFO L356 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-07-21 02:00:29,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 52 [2022-07-21 02:00:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:30,263 INFO L356 Elim1Store]: treesize reduction 239, result has 20.6 percent of original size [2022-07-21 02:00:30,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 165 [2022-07-21 02:00:30,310 INFO L356 Elim1Store]: treesize reduction 171, result has 20.5 percent of original size [2022-07-21 02:00:30,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 131 [2022-07-21 02:00:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,917 INFO L356 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-07-21 02:00:32,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 131 [2022-07-21 02:00:32,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,953 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-21 02:00:32,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 116 [2022-07-21 02:00:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:00:37,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:05,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219395825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:05,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:01:05,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2022-07-21 02:01:05,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811052957] [2022-07-21 02:01:05,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 02:01:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 02:01:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1463, Unknown=9, NotChecked=0, Total=1640 [2022-07-21 02:01:05,537 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-21 02:01:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:08,656 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-21 02:01:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 02:01:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 67 [2022-07-21 02:01:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:08,657 INFO L225 Difference]: With dead ends: 132 [2022-07-21 02:01:08,657 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 02:01:08,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=503, Invalid=4317, Unknown=10, NotChecked=0, Total=4830 [2022-07-21 02:01:08,659 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 140 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:08,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 535 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 280 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-07-21 02:01:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 02:01:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 02:01:08,660 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-07-21 02:01:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 02:01:08,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2022-07-21 02:01:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:08,660 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 02:01:08,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-21 02:01:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 02:01:08,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 02:01:08,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 02:01:08,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 02:01:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:08,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 02:01:50,274 WARN L233 SmtUtils]: Spent 41.27s on a formula simplification. DAG size of input: 244 DAG size of output: 228 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 02:02:03,405 WARN L233 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 215 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 02:02:22,510 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 511 DAG size of output: 173 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-21 02:02:23,064 INFO L895 garLoopResultBuilder]: At program point L622(line 622) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse3 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (< (+ |ULTIMATE.start_main_~n~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) .cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (exists ((|ULTIMATE.start_re_insert_~x#1.base| Int)) (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|))) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~x~0#1.offset|))) (and (< (+ |ULTIMATE.start_re_insert_~x#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse1 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_re_insert_~x#1.base| 0)) (not (= .cse2 0)) (= |ULTIMATE.start_re_insert_~x#1.base| (select (select |#memory_$Pointer$.base| .cse2) (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (= |ULTIMATE.start_main_~#list~0#1.base| .cse2))))) .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= (select (select (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (select .cse7 |ULTIMATE.start_main_~x~0#1.offset|))) (store |#memory_$Pointer$.base| .cse5 (store (select |#memory_$Pointer$.base| .cse5) (+ (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|) 4) (select .cse7 .cse8))))) |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.base|)) (= 0 (select .cse6 .cse8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.offset|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse0 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) .cse3))) [2022-07-21 02:02:23,064 INFO L895 garLoopResultBuilder]: At program point L622-1(line 622) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret22#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) [2022-07-21 02:02:23,064 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L902 garLoopResultBuilder]: At program point L623(lines 601 624) the Hoare annotation is: true [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 607 617) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse42 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse43 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse32 (select .cse43 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse30 (select .cse43 .cse42)) (.cse38 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse6 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse28 (select .cse27 .cse42)) (.cse40 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse39 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse41 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|))) (let ((.cse3 (select .cse27 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse13 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse4 (= (select .cse41 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_main_~n~0#1.base| 0))) (.cse17 (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse39 |ULTIMATE.start_main_~n~0#1.offset|))) (.cse19 (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)) (.cse2 (= (select .cse41 .cse40) 0)) (.cse9 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse11 (= (select .cse39 .cse40) 0)) (.cse20 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse8 (= .cse28 0)) (.cse24 (select .cse38 .cse6)) (.cse10 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|)) (.cse14 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse15 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse18 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse21 (= 0 .cse30)) (.cse23 (= .cse32 |ULTIMATE.start_main_~#list~0#1.offset|))) (or (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) .cse6))) (let ((.cse5 (select |#memory_$Pointer$.offset| .cse24)) (.cse7 (= |ULTIMATE.start_main_~#list~0#1.base| .cse24)) (.cse0 (select |#memory_$Pointer$.base| .cse24)) (.cse12 (+ .cse1 4))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse0 .cse1)) .cse2 (= |ULTIMATE.start_main_~tail~0#1.base| .cse3) .cse4 (or (= |ULTIMATE.start_main_~#list~0#1.offset| (select .cse5 .cse1)) (and (= .cse1 .cse6) .cse7)) .cse8 (< .cse9 |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) .cse10 (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) .cse11 (= (select .cse5 .cse12) 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) .cse3) .cse13 .cse14 .cse15 .cse16 (or (and (= .cse1 |ULTIMATE.start_main_~#list~0#1.offset|) .cse7) (= (select .cse0 .cse12) 0)) .cse17 (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) (and (let ((.cse25 (let ((.cse33 (let ((.cse35 (not (= .cse24 |ULTIMATE.start_main_~x~0#1.base|)))) (let ((.cse34 (let ((.cse36 (let ((.cse37 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse2 .cse37 (< .cse9 |ULTIMATE.start_main_~tail~0#1.base|) .cse11 .cse20) (and .cse37 .cse8 (= (select .cse38 |ULTIMATE.start_main_~#list~0#1.offset|) 0)))))) (or (and .cse36 .cse19) (and .cse36 .cse35))))) (or (and .cse34 .cse35) (and .cse4 .cse34 .cse16 .cse17)))))) (or (and (or (and (= .cse3 0) (= .cse28 .cse3)) (let ((.cse29 (+ .cse32 4))) (let ((.cse31 (select (select |#memory_$Pointer$.base| .cse3) .cse29))) (and (= (select (select |#memory_$Pointer$.offset| .cse3) .cse29) .cse30) (= .cse31 0) (= .cse28 .cse31))))) .cse13 .cse33 .cse22) (and .cse4 .cse13 .cse33 .cse17 .cse22)))) (.cse26 (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (or (and .cse25 .cse26 (= (select .cse27 .cse6) 0)) (and .cse25 .cse26 .cse16))) .cse10 .cse14 .cse15 .cse18 .cse21 .cse23))))) [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 02:02:23,065 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 617) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse26 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse0 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse7 (= (select .cse25 .cse26) 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse2 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse10 (= 0 (select .cse23 .cse26))) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and .cse0 .cse1 (< .cse2 |ULTIMATE.start_main_~tail~0#1.base|) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse8 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select .cse9 |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse4 .cse5 .cse10) (let ((.cse17 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse12 (select .cse9 .cse17)) (.cse24 (select .cse8 .cse17))) (let ((.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse16 (select |#memory_$Pointer$.offset| .cse24)) (.cse15 (select .cse25 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse18 (= |ULTIMATE.start_main_~#list~0#1.base| .cse24)) (.cse11 (select |#memory_$Pointer$.base| .cse24)) (.cse21 (+ .cse12 4)) (.cse22 (select .cse20 |ULTIMATE.start_main_~n~0#1.offset|)) (.cse19 (select .cse23 |ULTIMATE.start_main_~x~0#1.offset|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse11 .cse12)) (= (select .cse13 .cse14) 0) (= |ULTIMATE.start_main_~tail~0#1.base| .cse15) (= (select .cse13 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (or (= |ULTIMATE.start_main_~#list~0#1.offset| (select .cse16 .cse12)) (and (= .cse12 .cse17) .cse18)) .cse7 (= .cse19 |ULTIMATE.start_main_~tail~0#1.offset|) .cse3 (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select .cse20 .cse14) 0) (= (select .cse16 .cse21) 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) .cse15) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) .cse4 .cse5 (< .cse2 .cse22) (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (or (and (= .cse12 |ULTIMATE.start_main_~#list~0#1.offset|) .cse18) (= (select .cse11 .cse21) 0)) (= |ULTIMATE.start_main_~#list~0#1.base| .cse22) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) .cse6 .cse10 (< 0 |#StackHeapBarrier|) (= .cse19 |ULTIMATE.start_main_~#list~0#1.offset|)))))))) [2022-07-21 02:02:23,065 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L895 garLoopResultBuilder]: At program point L620-2(line 620) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse0 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< (+ |ULTIMATE.start_main_~n~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (not |ULTIMATE.start_main_#t~short21#1|) (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse2 (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ .cse8 4))) (let ((.cse5 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse4 (select .cse9 .cse7))) (and (= (select (select |#memory_$Pointer$.offset| .cse2) .cse3) .cse4) (= |ULTIMATE.start_main_~#list~0#1.base| .cse2) (= .cse5 0) (= (select .cse6 .cse7) .cse5) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= 0 .cse4) (= .cse8 |ULTIMATE.start_main_~#list~0#1.offset|))))))) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0) (< 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= 0 (select .cse10 .cse1)) (= (select .cse10 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|))) [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L895 garLoopResultBuilder]: At program point L620-4(line 620) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| .cse0 .cse1 .cse2) (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse11 (select .cse3 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= (select .cse3 .cse4) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (let ((.cse5 (= |ULTIMATE.start_main_~#list~0#1.base| .cse11)) (.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (.cse6 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse7 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|)) (.cse8 (not (= |ULTIMATE.start_main_~x~0#1.base| 0))) (.cse9 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|))) (or (and .cse5 |ULTIMATE.start_main_#t~short21#1| (< .cse6 |ULTIMATE.start_main_~#list~0#1.base|) .cse0 .cse7 .cse1 .cse2 .cse8 .cse9 (< 0 .cse10)) (and .cse5 (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| (not (= .cse10 |ULTIMATE.start_remove_~x#1.base|)) (< .cse6 |ULTIMATE.start_main_~tail~0#1.base|) .cse0 .cse7 .cse1 .cse2 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) .cse8 .cse9 (= |ULTIMATE.start_main_~n~0#1.offset| 0) (< 0 |#StackHeapBarrier|)))) (not (= .cse11 0)) (= 0 (select .cse12 .cse4)) (= (select .cse12 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2022-07-21 02:02:23,066 INFO L902 garLoopResultBuilder]: At program point is_list_containing_xENTRY(lines 593 600) the Hoare annotation is: true [2022-07-21 02:02:23,066 INFO L895 garLoopResultBuilder]: At program point L598(line 598) the Hoare annotation is: (let ((.cse28 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse19 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse28)) (.cse20 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse28))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse27 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse25 (select .cse27 0)) (.cse26 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse22 (select .cse26 0)) (.cse23 (+ .cse25 4))) (let ((.cse21 (select .cse27 4)) (.cse24 (select (select |#memory_$Pointer$.base| .cse22) .cse23))) (or (not (= .cse21 (select (select |#memory_$Pointer$.offset| .cse22) .cse23))) (not (= .cse21 0)) (not (= .cse24 0)) (not (= .cse25 0)) (not (= (select .cse26 4) .cse24)) (= .cse22 |ULTIMATE.start_main_~x~0#1.base|)))))))) (.cse9 (= .cse20 |is_list_containing_x_#t~mem14.base|)) (.cse1 (= |is_list_containing_x_#t~mem14.offset| .cse19)) (.cse10 (or (not (= .cse19 0)) (not (= .cse20 0))))) (and (or .cse0 .cse1 (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 ((.cse2 (select .cse3 0))) (or (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 1) .cse2)) (not (= (select (select |#memory_$Pointer$.base| .cse2) 4) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 0) (= .cse2 0) (not (= (select .cse3 4) 0))))))) (or .cse1 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37| Int)) (let ((.cse7 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|))) (let ((.cse8 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|)) (.cse6 (select .cse7 0))) (let ((.cse5 (+ .cse6 4)) (.cse4 (select .cse8 0))) (or (not (= (select (select |#memory_$Pointer$.offset| .cse4) .cse5) 0)) (not (= (select (select |#memory_$Pointer$.base| .cse4) .cse5) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|)) (not (= .cse6 0)) (not (= (select .cse7 4) 0)) (= 0 .cse4) (not (= (select .cse8 4) 0)) (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37| 1) .cse4)))))))) (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 .cse9 (not (< 0 |#StackHeapBarrier|))) (or .cse0 (and .cse9 (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (= |is_list_containing_x_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)))) .cse10)) (= |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|) (or (and .cse9 .cse1 .cse10) (forall ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse12 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29|) 4)) (.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29|) 4))) (let ((.cse11 (select |#memory_$Pointer$.offset| .cse16)) (.cse15 (select |#memory_$Pointer$.base| .cse16)) (.cse14 (+ .cse12 4)) (.cse13 (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| .cse16)))) (or (and (not (= (select .cse11 .cse12) 0)) (or .cse13 (not (= .cse12 4)))) (not (= (select .cse11 .cse14) 0)) (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| (select .cse15 .cse12))) (and (not (= (select .cse15 .cse14) 0)) (or (not (= .cse12 0)) .cse13)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse18 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23|)) (.cse17 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23|))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| 0) (not (= (select .cse17 4) 0)) (not (= (select .cse18 4) 0)) (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| 1) (select .cse18 0))) (not (= (select .cse17 0) 0)))))) (= |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|))))) [2022-07-21 02:02:23,066 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-07-21 02:02:23,067 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-07-21 02:02:23,068 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-07-21 02:02:23,068 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-21 02:02:23,068 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-07-21 02:02:23,068 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-21 02:02:23,070 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:02:23,072 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 02:02:23,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:02:23 BoogieIcfgContainer [2022-07-21 02:02:23,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 02:02:23,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 02:02:23,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 02:02:23,165 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 02:02:23,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:25" (3/4) ... [2022-07-21 02:02:23,168 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 02:02:23,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2022-07-21 02:02:23,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 02:02:23,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-21 02:02:23,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 02:02:23,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 02:02:23,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 02:02:23,208 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 02:02:23,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 02:02:23,208 INFO L158 Benchmark]: Toolchain (without parser) took 238456.36ms. Allocated memory was 60.8MB in the beginning and 360.7MB in the end (delta: 299.9MB). Free memory was 40.0MB in the beginning and 216.8MB in the end (delta: -176.8MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,209 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:02:23,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.05ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 37.3MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 60.8MB. Free memory was 37.1MB in the beginning and 35.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,212 INFO L158 Benchmark]: Boogie Preprocessor took 48.63ms. Allocated memory is still 60.8MB. Free memory was 35.1MB in the beginning and 33.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,212 INFO L158 Benchmark]: RCFGBuilder took 459.88ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 33.6MB in the beginning and 54.7MB in the end (delta: -21.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,212 INFO L158 Benchmark]: TraceAbstraction took 237491.18ms. Allocated memory was 79.7MB in the beginning and 360.7MB in the end (delta: 281.0MB). Free memory was 54.4MB in the beginning and 219.9MB in the end (delta: -165.5MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,213 INFO L158 Benchmark]: Witness Printer took 43.33ms. Allocated memory is still 360.7MB. Free memory was 219.9MB in the beginning and 216.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:02:23,214 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.19ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.05ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 37.3MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 60.8MB. Free memory was 37.1MB in the beginning and 35.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.63ms. Allocated memory is still 60.8MB. Free memory was 35.1MB in the beginning and 33.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.88ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 33.6MB in the beginning and 54.7MB in the end (delta: -21.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 237491.18ms. Allocated memory was 79.7MB in the beginning and 360.7MB in the end (delta: 281.0MB). Free memory was 54.4MB in the beginning and 219.9MB in the end (delta: -165.5MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. * Witness Printer took 43.33ms. Allocated memory is still 360.7MB. Free memory was 219.9MB in the beginning and 216.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * 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: 237.4s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 74.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2128 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2097 mSDsluCounter, 9777 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1578 IncrementalHoareTripleChecker+Unchecked, 8506 mSDsCounter, 1078 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5859 IncrementalHoareTripleChecker+Invalid, 8515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1078 mSolverCounterUnsat, 1271 mSDtfsCounter, 5859 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 1221 SyntacticMatches, 37 SemanticMatches, 592 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6100 ImplicationChecksByTransitivity, 132.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=18, InterpolantAutomatonStates: 379, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 513 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 217 PreInvPairs, 243 NumberOfFragments, 3043 HoareAnnotationTreeSize, 217 FomulaSimplifications, 161790 FormulaSimplificationTreeSizeReduction, 57.7s HoareSimplificationTime, 10 FomulaSimplificationsInter, 4169437 FormulaSimplificationTreeSizeReductionInter, 16.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 109.2s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2001 ConstructedInterpolants, 224 QuantifiedInterpolants, 30165 SizeOfPredicates, 265 NumberOfNonLiveVariables, 4644 ConjunctsInSsa, 916 ConjunctsInUnsatCore, 45 InterpolantComputations, 10 PerfectInterpolantSequences, 1041/1330 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-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:02:23,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((list == #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4]] && #memory_$Pointer$[n][n + 4] == 0) && tail == #memory_$Pointer$[x][x]) && #memory_$Pointer$[n][n] == list) && (list == #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4]] || (#memory_$Pointer$[list][list + 4] == list + 4 && list == #memory_$Pointer$[list][list + 4]))) && #memory_$Pointer$[x][x + 4] == 0) && n + 1 < list) && \valid[list] == 1) && list == tail) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4] + 4] == 0) && x + 1 < #memory_$Pointer$[x][x]) && \valid[x] == 1) && list == x) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && ((#memory_$Pointer$[list][list + 4] == list && list == #memory_$Pointer$[list][list + 4]) || #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4] + 4] == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[x][x] == list) || (((((((((((((((#memory_$Pointer$[x][x] == 0 && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x]) || ((#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == 0) && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])) && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && 0 < unknown-#StackHeapBarrier-unknown) || ((((#memory_$Pointer$[n][n] == list && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && list == #memory_$Pointer$[n][n]) && 0 < unknown-#StackHeapBarrier-unknown)) && x == 0) && #memory_$Pointer$[x][list + 4] == 0) || ((((((((#memory_$Pointer$[x][x] == 0 && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x]) || ((#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == 0) && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])) && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && 0 < unknown-#StackHeapBarrier-unknown) || ((((#memory_$Pointer$[n][n] == list && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && list == #memory_$Pointer$[n][n]) && 0 < unknown-#StackHeapBarrier-unknown)) && x == 0) && !(n == 0))) && list == tail) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) RESULT: Ultimate proved your program to be correct! [2022-07-21 02:02:23,503 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-21 02:02:23,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE