./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 16:02:51,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 16:02:51,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 16:02:51,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 16:02:51,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 16:02:51,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 16:02:51,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 16:02:51,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 16:02:51,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 16:02:51,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 16:02:51,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 16:02:51,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 16:02:51,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 16:02:51,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 16:02:51,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 16:02:51,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 16:02:51,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 16:02:51,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 16:02:51,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 16:02:51,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 16:02:51,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 16:02:51,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 16:02:51,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 16:02:51,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 16:02:51,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 16:02:51,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 16:02:51,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 16:02:51,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 16:02:51,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 16:02:51,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 16:02:51,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 16:02:51,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 16:02:51,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 16:02:51,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 16:02:51,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 16:02:51,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 16:02:51,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 16:02:51,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 16:02:51,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 16:02:51,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 16:02:51,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 16:02:51,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 16:02:51,777 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 16:02:51,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 16:02:51,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 16:02:51,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 16:02:51,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 16:02:51,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 16:02:51,781 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 16:02:51,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 16:02:51,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 16:02:51,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 16:02:51,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 16:02:51,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 16:02:51,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 16:02:51,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 16:02:51,783 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 16:02:51,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 16:02:51,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 16:02:51,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 16:02:51,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 16:02:51,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 16:02:51,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 16:02:51,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 16:02:51,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 16:02:51,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 16:02:51,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 16:02:51,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 16:02:51,785 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 16:02:51,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 16:02:51,786 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 16:02:51,786 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2021-11-06 16:02:51,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 16:02:51,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 16:02:52,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 16:02:52,002 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 16:02:52,003 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 16:02:52,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-11-06 16:02:52,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a24da86/a6d8cb4a4cde4a78b8ea62dfb1f9ee22/FLAG6300021ea [2021-11-06 16:02:52,590 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 16:02:52,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-11-06 16:02:52,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a24da86/a6d8cb4a4cde4a78b8ea62dfb1f9ee22/FLAG6300021ea [2021-11-06 16:02:53,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a24da86/a6d8cb4a4cde4a78b8ea62dfb1f9ee22 [2021-11-06 16:02:53,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 16:02:53,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 16:02:53,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 16:02:53,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 16:02:53,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 16:02:53,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:53,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53, skipping insertion in model container [2021-11-06 16:02:53,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:53,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 16:02:53,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 16:02:53,715 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-11-06 16:02:53,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 16:02:53,761 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 16:02:53,890 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-11-06 16:02:53,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 16:02:53,925 INFO L208 MainTranslator]: Completed translation [2021-11-06 16:02:53,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53 WrapperNode [2021-11-06 16:02:53,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 16:02:53,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 16:02:53,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 16:02:53,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 16:02:53,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:53,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 16:02:54,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 16:02:54,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 16:02:54,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 16:02:54,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 16:02:54,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 16:02:54,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 16:02:54,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 16:02:54,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (1/1) ... [2021-11-06 16:02:54,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 16:02:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:54,098 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) [2021-11-06 16:02:54,119 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 [2021-11-06 16:02:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 16:02:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 16:02:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 16:02:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 16:02:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 16:02:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 16:02:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 16:02:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 16:02:54,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 16:02:54,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 16:02:54,638 INFO L299 CfgBuilder]: Removed 60 assume(true) statements. [2021-11-06 16:02:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:02:54 BoogieIcfgContainer [2021-11-06 16:02:54,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 16:02:54,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 16:02:54,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 16:02:54,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 16:02:54,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 04:02:53" (1/3) ... [2021-11-06 16:02:54,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7ce323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 04:02:54, skipping insertion in model container [2021-11-06 16:02:54,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:02:53" (2/3) ... [2021-11-06 16:02:54,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7ce323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 04:02:54, skipping insertion in model container [2021-11-06 16:02:54,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:02:54" (3/3) ... [2021-11-06 16:02:54,645 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-11-06 16:02:54,649 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 16:02:54,649 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 16:02:54,682 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 16:02:54,686 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 16:02:54,686 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 16:02:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 68 states have internal predecessors, (97), 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) [2021-11-06 16:02:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 16:02:54,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:54,701 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 16:02:54,702 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1281190692, now seen corresponding path program 1 times [2021-11-06 16:02:54,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:54,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544110673] [2021-11-06 16:02:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:54,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:02:54,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:54,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544110673] [2021-11-06 16:02:54,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544110673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:54,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:54,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:02:54,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130041530] [2021-11-06 16:02:54,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 16:02:54,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:54,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 16:02:54,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 16:02:54,967 INFO L87 Difference]: Start difference. First operand has 69 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 68 states have internal predecessors, (97), 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) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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) [2021-11-06 16:02:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:54,980 INFO L93 Difference]: Finished difference Result 134 states and 189 transitions. [2021-11-06 16:02:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 16:02:54,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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) Word has length 26 [2021-11-06 16:02:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:54,987 INFO L225 Difference]: With dead ends: 134 [2021-11-06 16:02:54,988 INFO L226 Difference]: Without dead ends: 62 [2021-11-06 16:02:54,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 16:02:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-06 16:02:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-06 16:02:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 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) [2021-11-06 16:02:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2021-11-06 16:02:55,018 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 26 [2021-11-06 16:02:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,018 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-11-06 16:02:55,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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) [2021-11-06 16:02:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2021-11-06 16:02:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 16:02:55,019 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,020 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 16:02:55,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 16:02:55,020 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2081775912, now seen corresponding path program 1 times [2021-11-06 16:02:55,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853446319] [2021-11-06 16:02:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:02:55,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853446319] [2021-11-06 16:02:55,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853446319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:55,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:55,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:55,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881927898] [2021-11-06 16:02:55,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:55,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,113 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2021-11-06 16:02:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:55,161 INFO L93 Difference]: Finished difference Result 145 states and 204 transitions. [2021-11-06 16:02:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2021-11-06 16:02:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:55,163 INFO L225 Difference]: With dead ends: 145 [2021-11-06 16:02:55,164 INFO L226 Difference]: Without dead ends: 100 [2021-11-06 16:02:55,164 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-06 16:02:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-11-06 16:02:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 97 states have internal predecessors, (136), 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) [2021-11-06 16:02:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2021-11-06 16:02:55,176 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 26 [2021-11-06 16:02:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,177 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2021-11-06 16:02:55,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2021-11-06 16:02:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2021-11-06 16:02:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 16:02:55,178 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,178 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 16:02:55,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 16:02:55,179 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1580720026, now seen corresponding path program 1 times [2021-11-06 16:02:55,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272948013] [2021-11-06 16:02:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:02:55,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272948013] [2021-11-06 16:02:55,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272948013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:55,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:55,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:55,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781460746] [2021-11-06 16:02:55,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:55,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,290 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-11-06 16:02:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:55,311 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2021-11-06 16:02:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) Word has length 30 [2021-11-06 16:02:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:55,312 INFO L225 Difference]: With dead ends: 104 [2021-11-06 16:02:55,313 INFO L226 Difference]: Without dead ends: 101 [2021-11-06 16:02:55,313 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-06 16:02:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2021-11-06 16:02:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.40625) internal successors, (135), 97 states have internal predecessors, (135), 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) [2021-11-06 16:02:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2021-11-06 16:02:55,321 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 30 [2021-11-06 16:02:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,322 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2021-11-06 16:02:55,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-11-06 16:02:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2021-11-06 16:02:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 16:02:55,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,323 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 16:02:55,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 16:02:55,323 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1580779608, now seen corresponding path program 1 times [2021-11-06 16:02:55,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015896533] [2021-11-06 16:02:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:02:55,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015896533] [2021-11-06 16:02:55,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015896533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:55,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:55,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:02:55,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109575407] [2021-11-06 16:02:55,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:55,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:55,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,378 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2021-11-06 16:02:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:55,414 INFO L93 Difference]: Finished difference Result 256 states and 364 transitions. [2021-11-06 16:02:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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) Word has length 30 [2021-11-06 16:02:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:55,418 INFO L225 Difference]: With dead ends: 256 [2021-11-06 16:02:55,418 INFO L226 Difference]: Without dead ends: 173 [2021-11-06 16:02:55,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-06 16:02:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2021-11-06 16:02:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.4285714285714286) internal successors, (240), 169 states have internal predecessors, (240), 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) [2021-11-06 16:02:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2021-11-06 16:02:55,430 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 30 [2021-11-06 16:02:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,431 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2021-11-06 16:02:55,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2021-11-06 16:02:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2021-11-06 16:02:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 16:02:55,432 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,432 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 16:02:55,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 16:02:55,432 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1049907741, now seen corresponding path program 1 times [2021-11-06 16:02:55,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176373746] [2021-11-06 16:02:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:02:55,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176373746] [2021-11-06 16:02:55,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176373746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:55,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:55,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:55,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43127407] [2021-11-06 16:02:55,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:55,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,524 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-11-06 16:02:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:55,561 INFO L93 Difference]: Finished difference Result 387 states and 552 transitions. [2021-11-06 16:02:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2021-11-06 16:02:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:55,565 INFO L225 Difference]: With dead ends: 387 [2021-11-06 16:02:55,565 INFO L226 Difference]: Without dead ends: 234 [2021-11-06 16:02:55,567 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-06 16:02:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2021-11-06 16:02:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 1.4210526315789473) internal successors, (324), 229 states have internal predecessors, (324), 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) [2021-11-06 16:02:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2021-11-06 16:02:55,586 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 35 [2021-11-06 16:02:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,586 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2021-11-06 16:02:55,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-11-06 16:02:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2021-11-06 16:02:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 16:02:55,587 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,588 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:55,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 16:02:55,588 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -149586268, now seen corresponding path program 1 times [2021-11-06 16:02:55,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743186235] [2021-11-06 16:02:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:02:55,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743186235] [2021-11-06 16:02:55,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743186235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:55,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:55,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:55,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568243495] [2021-11-06 16:02:55,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:55,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:55,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,720 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2021-11-06 16:02:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:55,744 INFO L93 Difference]: Finished difference Result 450 states and 639 transitions. [2021-11-06 16:02:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 46 [2021-11-06 16:02:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:55,751 INFO L225 Difference]: With dead ends: 450 [2021-11-06 16:02:55,752 INFO L226 Difference]: Without dead ends: 232 [2021-11-06 16:02:55,753 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-06 16:02:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-11-06 16:02:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 231 states have internal predecessors, (326), 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) [2021-11-06 16:02:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2021-11-06 16:02:55,781 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 46 [2021-11-06 16:02:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:55,782 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2021-11-06 16:02:55,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2021-11-06 16:02:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2021-11-06 16:02:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 16:02:55,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:55,786 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:55,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 16:02:55,786 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -441874010, now seen corresponding path program 1 times [2021-11-06 16:02:55,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:55,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449577214] [2021-11-06 16:02:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 16:02:55,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:55,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449577214] [2021-11-06 16:02:55,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449577214] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:55,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838012426] [2021-11-06 16:02:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:55,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:55,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:55,951 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) [2021-11-06 16:02:55,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 16:02:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:56,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-06 16:02:56,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:02:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 16:02:56,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838012426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:56,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 16:02:56,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-06 16:02:56,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096092781] [2021-11-06 16:02:56,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:02:56,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:02:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 16:02:56,312 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-11-06 16:02:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:56,347 INFO L93 Difference]: Finished difference Result 781 states and 1104 transitions. [2021-11-06 16:02:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 16:02:56,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) Word has length 48 [2021-11-06 16:02:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:56,350 INFO L225 Difference]: With dead ends: 781 [2021-11-06 16:02:56,351 INFO L226 Difference]: Without dead ends: 568 [2021-11-06 16:02:56,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-06 16:02:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-06 16:02:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 238. [2021-11-06 16:02:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 237 states have internal predecessors, (330), 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) [2021-11-06 16:02:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 330 transitions. [2021-11-06 16:02:56,363 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 330 transitions. Word has length 48 [2021-11-06 16:02:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:56,363 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 330 transitions. [2021-11-06 16:02:56,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-11-06 16:02:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 330 transitions. [2021-11-06 16:02:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 16:02:56,368 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:56,368 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:56,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 16:02:56,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:56,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:56,588 INFO L85 PathProgramCache]: Analyzing trace with hash -384615708, now seen corresponding path program 1 times [2021-11-06 16:02:56,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:56,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125692793] [2021-11-06 16:02:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:56,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:02:56,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:56,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125692793] [2021-11-06 16:02:56,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125692793] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:56,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002099072] [2021-11-06 16:02:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:56,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:56,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:56,638 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) [2021-11-06 16:02:56,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 16:02:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 16:02:56,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:02:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 16:02:56,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002099072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:56,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 16:02:56,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-06 16:02:56,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163780406] [2021-11-06 16:02:56,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:56,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:02:56,923 INFO L87 Difference]: Start difference. First operand 238 states and 330 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2021-11-06 16:02:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:56,936 INFO L93 Difference]: Finished difference Result 602 states and 843 transitions. [2021-11-06 16:02:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 48 [2021-11-06 16:02:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:56,938 INFO L225 Difference]: With dead ends: 602 [2021-11-06 16:02:56,938 INFO L226 Difference]: Without dead ends: 383 [2021-11-06 16:02:56,938 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:02:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-06 16:02:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 233. [2021-11-06 16:02:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 231 states have (on average 1.3896103896103895) internal successors, (321), 232 states have internal predecessors, (321), 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) [2021-11-06 16:02:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 321 transitions. [2021-11-06 16:02:56,947 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 321 transitions. Word has length 48 [2021-11-06 16:02:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:56,947 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 321 transitions. [2021-11-06 16:02:56,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2021-11-06 16:02:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 321 transitions. [2021-11-06 16:02:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 16:02:56,948 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:56,948 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:56,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-06 16:02:57,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-06 16:02:57,156 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1309075040, now seen corresponding path program 1 times [2021-11-06 16:02:57,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:57,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496720418] [2021-11-06 16:02:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:57,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 16:02:57,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:57,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496720418] [2021-11-06 16:02:57,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496720418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:57,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:57,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:57,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242702951] [2021-11-06 16:02:57,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 16:02:57,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 16:02:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 16:02:57,254 INFO L87 Difference]: Start difference. First operand 233 states and 321 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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) [2021-11-06 16:02:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:57,279 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2021-11-06 16:02:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 16:02:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 50 [2021-11-06 16:02:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:57,281 INFO L225 Difference]: With dead ends: 350 [2021-11-06 16:02:57,284 INFO L226 Difference]: Without dead ends: 348 [2021-11-06 16:02:57,284 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 16:02:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-06 16:02:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2021-11-06 16:02:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 342 states have (on average 1.4035087719298245) internal successors, (480), 343 states have internal predecessors, (480), 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) [2021-11-06 16:02:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 480 transitions. [2021-11-06 16:02:57,293 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 480 transitions. Word has length 50 [2021-11-06 16:02:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:57,294 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 480 transitions. [2021-11-06 16:02:57,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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) [2021-11-06 16:02:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 480 transitions. [2021-11-06 16:02:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 16:02:57,295 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:57,295 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:57,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 16:02:57,296 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1524403008, now seen corresponding path program 1 times [2021-11-06 16:02:57,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:57,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239095924] [2021-11-06 16:02:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:57,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 16:02:57,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:57,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239095924] [2021-11-06 16:02:57,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239095924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:57,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:02:57,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:02:57,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193274703] [2021-11-06 16:02:57,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:02:57,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:02:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:57,363 INFO L87 Difference]: Start difference. First operand 344 states and 480 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2021-11-06 16:02:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:57,377 INFO L93 Difference]: Finished difference Result 724 states and 1019 transitions. [2021-11-06 16:02:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:02:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) Word has length 57 [2021-11-06 16:02:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:57,380 INFO L225 Difference]: With dead ends: 724 [2021-11-06 16:02:57,380 INFO L226 Difference]: Without dead ends: 494 [2021-11-06 16:02:57,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:02:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-06 16:02:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 344. [2021-11-06 16:02:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 342 states have (on average 1.391812865497076) internal successors, (476), 343 states have internal predecessors, (476), 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) [2021-11-06 16:02:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 476 transitions. [2021-11-06 16:02:57,389 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 476 transitions. Word has length 57 [2021-11-06 16:02:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:57,390 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 476 transitions. [2021-11-06 16:02:57,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2021-11-06 16:02:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 476 transitions. [2021-11-06 16:02:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 16:02:57,391 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:57,391 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:57,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 16:02:57,391 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2111209022, now seen corresponding path program 1 times [2021-11-06 16:02:57,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:57,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376576522] [2021-11-06 16:02:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:57,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:02:57,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:57,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376576522] [2021-11-06 16:02:57,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376576522] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:57,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421238033] [2021-11-06 16:02:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:57,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:57,474 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) [2021-11-06 16:02:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 16:02:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:57,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 16:02:57,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:02:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-06 16:02:57,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421238033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:02:57,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 16:02:57,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-11-06 16:02:57,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243517951] [2021-11-06 16:02:57,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:02:57,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:02:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 16:02:57,880 INFO L87 Difference]: Start difference. First operand 344 states and 476 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2021-11-06 16:02:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:57,938 INFO L93 Difference]: Finished difference Result 890 states and 1252 transitions. [2021-11-06 16:02:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 16:02:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 57 [2021-11-06 16:02:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:57,941 INFO L225 Difference]: With dead ends: 890 [2021-11-06 16:02:57,941 INFO L226 Difference]: Without dead ends: 660 [2021-11-06 16:02:57,941 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-06 16:02:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-11-06 16:02:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 344. [2021-11-06 16:02:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 342 states have (on average 1.3801169590643274) internal successors, (472), 343 states have internal predecessors, (472), 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) [2021-11-06 16:02:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 472 transitions. [2021-11-06 16:02:57,952 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 472 transitions. Word has length 57 [2021-11-06 16:02:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 472 transitions. [2021-11-06 16:02:57,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2021-11-06 16:02:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 472 transitions. [2021-11-06 16:02:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 16:02:57,953 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:57,953 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:57,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 16:02:58,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:58,168 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1004371994, now seen corresponding path program 1 times [2021-11-06 16:02:58,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:58,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150017657] [2021-11-06 16:02:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:58,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 16:02:58,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:58,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150017657] [2021-11-06 16:02:58,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150017657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:58,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433316071] [2021-11-06 16:02:58,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:58,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:58,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:58,253 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) [2021-11-06 16:02:58,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 16:02:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:58,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-06 16:02:58,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:02:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 16:02:58,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433316071] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:58,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 16:02:58,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 16:02:58,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305623602] [2021-11-06 16:02:58,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:02:58,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:02:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:02:58,604 INFO L87 Difference]: Start difference. First operand 344 states and 472 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) [2021-11-06 16:02:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:58,629 INFO L93 Difference]: Finished difference Result 677 states and 934 transitions. [2021-11-06 16:02:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 16:02:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) Word has length 60 [2021-11-06 16:02:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:58,631 INFO L225 Difference]: With dead ends: 677 [2021-11-06 16:02:58,631 INFO L226 Difference]: Without dead ends: 346 [2021-11-06 16:02:58,632 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:02:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-11-06 16:02:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-11-06 16:02:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 1.377906976744186) internal successors, (474), 345 states have internal predecessors, (474), 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) [2021-11-06 16:02:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 474 transitions. [2021-11-06 16:02:58,642 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 474 transitions. Word has length 60 [2021-11-06 16:02:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:58,642 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 474 transitions. [2021-11-06 16:02:58,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) [2021-11-06 16:02:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 474 transitions. [2021-11-06 16:02:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 16:02:58,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:58,643 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-11-06 16:02:58,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 16:02:58,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:58,865 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash -661340892, now seen corresponding path program 2 times [2021-11-06 16:02:58,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:58,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885008100] [2021-11-06 16:02:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:58,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 16:02:59,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:59,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885008100] [2021-11-06 16:02:59,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885008100] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:59,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773135754] [2021-11-06 16:02:59,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 16:02:59,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:59,034 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) [2021-11-06 16:02:59,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 16:02:59,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 16:02:59,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 16:02:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-06 16:02:59,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:02:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 16:02:59,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773135754] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:59,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 16:02:59,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-06 16:02:59,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390238802] [2021-11-06 16:02:59,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 16:02:59,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:02:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 16:02:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 16:02:59,454 INFO L87 Difference]: Start difference. First operand 346 states and 474 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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) [2021-11-06 16:02:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:02:59,486 INFO L93 Difference]: Finished difference Result 680 states and 937 transitions. [2021-11-06 16:02:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 16:02:59,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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) Word has length 62 [2021-11-06 16:02:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:02:59,488 INFO L225 Difference]: With dead ends: 680 [2021-11-06 16:02:59,488 INFO L226 Difference]: Without dead ends: 348 [2021-11-06 16:02:59,489 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 16:02:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-06 16:02:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2021-11-06 16:02:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 346 states have (on average 1.3757225433526012) internal successors, (476), 347 states have internal predecessors, (476), 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) [2021-11-06 16:02:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 476 transitions. [2021-11-06 16:02:59,498 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 476 transitions. Word has length 62 [2021-11-06 16:02:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:02:59,498 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 476 transitions. [2021-11-06 16:02:59,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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) [2021-11-06 16:02:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 476 transitions. [2021-11-06 16:02:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 16:02:59,499 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:02:59,499 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:02:59,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 16:02:59,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-06 16:02:59,715 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:02:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:02:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1957280934, now seen corresponding path program 3 times [2021-11-06 16:02:59,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:02:59,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000433382] [2021-11-06 16:02:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:02:59,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:02:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:02:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-06 16:02:59,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:02:59,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000433382] [2021-11-06 16:02:59,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000433382] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:02:59,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397327950] [2021-11-06 16:02:59,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 16:02:59,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:02:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:02:59,824 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) [2021-11-06 16:02:59,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 16:03:00,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 16:03:00,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 16:03:00,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-06 16:03:00,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:03:00,257 INFO L388 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 46 treesize of output 30 [2021-11-06 16:03:00,262 INFO L388 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 27 treesize of output 11 [2021-11-06 16:03:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-06 16:03:00,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397327950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:03:00,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 16:03:00,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-11-06 16:03:00,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226180059] [2021-11-06 16:03:00,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:03:00,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:03:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:03:00,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 16:03:00,331 INFO L87 Difference]: Start difference. First operand 348 states and 476 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 16:03:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:03:00,381 INFO L93 Difference]: Finished difference Result 908 states and 1259 transitions. [2021-11-06 16:03:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 16:03:00,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) Word has length 64 [2021-11-06 16:03:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:03:00,383 INFO L225 Difference]: With dead ends: 908 [2021-11-06 16:03:00,383 INFO L226 Difference]: Without dead ends: 583 [2021-11-06 16:03:00,384 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-06 16:03:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-06 16:03:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 360. [2021-11-06 16:03:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 358 states have (on average 1.3631284916201116) internal successors, (488), 359 states have internal predecessors, (488), 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) [2021-11-06 16:03:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 488 transitions. [2021-11-06 16:03:00,394 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 488 transitions. Word has length 64 [2021-11-06 16:03:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:03:00,394 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 488 transitions. [2021-11-06 16:03:00,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 16:03:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 488 transitions. [2021-11-06 16:03:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 16:03:00,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:03:00,399 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:03:00,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-06 16:03:00,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:03:00,616 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:03:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:03:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1823267428, now seen corresponding path program 1 times [2021-11-06 16:03:00,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:03:00,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608638637] [2021-11-06 16:03:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:03:00,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:03:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:03:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-06 16:03:00,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:03:00,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608638637] [2021-11-06 16:03:00,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608638637] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:03:00,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645303096] [2021-11-06 16:03:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:03:00,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:03:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:03:00,731 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) [2021-11-06 16:03:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 16:03:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:03:01,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-06 16:03:01,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:03:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-06 16:03:01,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645303096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:03:01,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 16:03:01,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-06 16:03:01,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725473841] [2021-11-06 16:03:01,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 16:03:01,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:03:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 16:03:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-06 16:03:01,194 INFO L87 Difference]: Start difference. First operand 360 states and 488 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) [2021-11-06 16:03:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:03:01,248 INFO L93 Difference]: Finished difference Result 707 states and 964 transitions. [2021-11-06 16:03:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 16:03:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) Word has length 64 [2021-11-06 16:03:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:03:01,250 INFO L225 Difference]: With dead ends: 707 [2021-11-06 16:03:01,250 INFO L226 Difference]: Without dead ends: 362 [2021-11-06 16:03:01,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-06 16:03:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-06 16:03:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-11-06 16:03:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 360 states have (on average 1.3611111111111112) internal successors, (490), 361 states have internal predecessors, (490), 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) [2021-11-06 16:03:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 490 transitions. [2021-11-06 16:03:01,260 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 490 transitions. Word has length 64 [2021-11-06 16:03:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:03:01,260 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 490 transitions. [2021-11-06 16:03:01,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) [2021-11-06 16:03:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 490 transitions. [2021-11-06 16:03:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 16:03:01,261 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:03:01,261 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:03:01,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 16:03:01,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:03:01,469 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:03:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:03:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -471457758, now seen corresponding path program 2 times [2021-11-06 16:03:01,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:03:01,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902459674] [2021-11-06 16:03:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:03:01,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:03:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:03:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 16:03:02,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:03:02,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902459674] [2021-11-06 16:03:02,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902459674] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 16:03:02,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147548549] [2021-11-06 16:03:02,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 16:03:02,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 16:03:02,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:03:02,159 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) [2021-11-06 16:03:02,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 16:03:02,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 16:03:02,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 16:03:02,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-06 16:03:02,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 16:03:02,762 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 16:03:02,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2021-11-06 16:03:02,770 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 16:03:02,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2021-11-06 16:03:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-06 16:03:02,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147548549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:03:02,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 16:03:02,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2021-11-06 16:03:02,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146184232] [2021-11-06 16:03:02,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:03:02,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:03:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:03:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-06 16:03:02,849 INFO L87 Difference]: Start difference. First operand 362 states and 490 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 16:03:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:03:02,965 INFO L93 Difference]: Finished difference Result 815 states and 1107 transitions. [2021-11-06 16:03:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 16:03:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) Word has length 66 [2021-11-06 16:03:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:03:02,967 INFO L225 Difference]: With dead ends: 815 [2021-11-06 16:03:02,967 INFO L226 Difference]: Without dead ends: 577 [2021-11-06 16:03:02,968 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-06 16:03:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-11-06 16:03:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 261. [2021-11-06 16:03:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 260 states have internal predecessors, (343), 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) [2021-11-06 16:03:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 343 transitions. [2021-11-06 16:03:02,979 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 343 transitions. Word has length 66 [2021-11-06 16:03:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:03:02,979 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 343 transitions. [2021-11-06 16:03:02,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 16:03:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 343 transitions. [2021-11-06 16:03:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 16:03:02,980 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:03:02,980 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:03:03,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 16:03:03,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-06 16:03:03,196 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 16:03:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:03:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1010145065, now seen corresponding path program 1 times [2021-11-06 16:03:03,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:03:03,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002992193] [2021-11-06 16:03:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:03:03,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:03:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:03:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 16:03:03,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:03:03,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002992193] [2021-11-06 16:03:03,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002992193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:03:03,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:03:03,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 16:03:03,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141319059] [2021-11-06 16:03:03,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:03:03,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:03:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:03:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:03:03,277 INFO L87 Difference]: Start difference. First operand 261 states and 343 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-11-06 16:03:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:03:03,295 INFO L93 Difference]: Finished difference Result 261 states and 343 transitions. [2021-11-06 16:03:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 16:03:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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) Word has length 68 [2021-11-06 16:03:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:03:03,295 INFO L225 Difference]: With dead ends: 261 [2021-11-06 16:03:03,296 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 16:03:03,296 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:03:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 16:03:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 16:03:03,297 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) [2021-11-06 16:03:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 16:03:03,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-11-06 16:03:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:03:03,297 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 16:03:03,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-11-06 16:03:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 16:03:03,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 16:03:03,299 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:03:03,300 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:03:03,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 16:03:03,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 16:03:03,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:03:03,852 INFO L857 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2021-11-06 16:03:03,852 INFO L857 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L853 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L853 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ (* ULTIMATE.start_pppox_create_~protocol 8) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) 16))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (= .cse3 ULTIMATE.start_ldv_try_module_get_~module.base)) (.cse1 (= ULTIMATE.start_ldv_try_module_get_~module.offset .cse4)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_#res| 0) .cse0 .cse1 .cse2) (and .cse0 (<= 2 ~ldv_module_refcounter~0) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res|) (not (= 0 (mod (+ .cse3 .cse4) 18446744073709551616))) (<= ~ldv_module_refcounter~0 2) .cse1 .cse2)))))) [2021-11-06 16:03:03,853 INFO L860 garLoopResultBuilder]: At program point L5932-1(lines 5931 5934) the Hoare annotation is: true [2021-11-06 16:03:03,853 INFO L860 garLoopResultBuilder]: At program point L5932-2(lines 5931 5934) the Hoare annotation is: true [2021-11-06 16:03:03,853 INFO L860 garLoopResultBuilder]: At program point L5932(lines 5931 5934) the Hoare annotation is: true [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L860 garLoopResultBuilder]: At program point L6362(lines 6359 6368) the Hoare annotation is: true [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6263(line 6263) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6263-1(line 6263) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2021-11-06 16:03:03,853 INFO L857 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ (* ULTIMATE.start_pppox_create_~protocol 8) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (= .cse0 ULTIMATE.start_ldv_try_module_get_~module.base) (not (= 0 (mod (+ .cse0 .cse1) 18446744073709551616))) (= ULTIMATE.start_ldv_try_module_get_~module.offset .cse1) (= ~ldv_retval_0~0 0))))) [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L6397(lines 1 6402) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L5902(lines 5894 5904) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L5902-1(lines 5894 5904) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: (let ((.cse7 (+ (* ULTIMATE.start_pppox_create_~protocol 8) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) 16))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (= .cse3 ULTIMATE.start_ldv_try_module_get_~module.base)) (.cse1 (= ULTIMATE.start_ldv_try_module_get_~module.offset .cse4)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_#res| 0) .cse0 (= 0 |ULTIMATE.start_ldv_try_module_get_5_#res|) .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res|) (<= 2 ~ldv_module_refcounter~0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res|) (not (= 0 (mod (+ .cse3 .cse4) 18446744073709551616))) (<= ~ldv_module_refcounter~0 2) .cse1 .cse2)))))) [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L853 garLoopResultBuilder]: At program point L6134(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2021-11-06 16:03:03,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L853 garLoopResultBuilder]: At program point L6334-2(lines 1 6402) the Hoare annotation is: (let ((.cse4 (+ (* ULTIMATE.start_pppox_create_~protocol 8) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (= .cse0 ULTIMATE.start_ldv_try_module_get_~module.base) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res|) (<= |ULTIMATE.start_ldv_try_module_get_5_#res| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res|) (<= ULTIMATE.start_pppox_create_~tmp~8 1) (= ULTIMATE.start_pppox_create_~tmp___0~3 0) (not (= 0 (mod (+ .cse0 .cse1) 18446744073709551616))) (= ULTIMATE.start_ldv_try_module_get_~module.offset .cse1) (<= 1 ULTIMATE.start_pppox_create_~tmp~8) (= ~ldv_retval_0~0 0) (not (= 0 (mod (+ ULTIMATE.start_ldv_module_put_~module.base ULTIMATE.start_ldv_module_put_~module.offset) 18446744073709551616))))))) [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L5857(lines 5857 5859) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L5857-1(lines 5857 5859) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L853 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L853 garLoopResultBuilder]: At program point L6221(lines 6362 6365) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2021-11-06 16:03:03,855 INFO L857 garLoopResultBuilder]: For program point L5858-2(line 5858) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L853 garLoopResultBuilder]: At program point L5910(lines 5905 5912) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,856 INFO L853 garLoopResultBuilder]: At program point L5910-1(lines 5905 5912) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,856 INFO L860 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L853 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L853 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L853 garLoopResultBuilder]: At program point L-1-7(line -1) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2021-11-06 16:03:03,856 INFO L857 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2021-11-06 16:03:03,857 INFO L857 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2021-11-06 16:03:03,857 INFO L853 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-06 16:03:03,857 INFO L857 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2021-11-06 16:03:03,860 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:03:03,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 16:03:03,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:03,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:03,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 04:03:03 BoogieIcfgContainer [2021-11-06 16:03:03,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 16:03:03,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 16:03:03,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 16:03:03,925 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 16:03:03,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:02:54" (3/4) ... [2021-11-06 16:03:03,930 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 16:03:03,946 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2021-11-06 16:03:03,947 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-06 16:03:03,947 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-06 16:03:03,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 16:03:03,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1 && \result == 0) && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) || ((((((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module && 2 <= ldv_module_refcounter) && 1 <= \result) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && ldv_module_refcounter <= 2) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) [2021-11-06 16:03:03,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_module_refcounter == 1 && \result == 0) && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && 0 == \result) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) || ((((((((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module && 1 <= \result) && 2 <= ldv_module_refcounter) && \result <= 1) && 1 <= \result) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && ldv_module_refcounter <= 2) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) [2021-11-06 16:03:03,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_module_refcounter == 1 && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && 1 <= \result) && \result <= 1) && 1 <= \result) && tmp <= 1) && tmp___0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && 1 <= tmp) && ldv_retval_0 == 0) && !(0 == (module + module) % 18446744073709551616) [2021-11-06 16:03:04,008 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 16:03:04,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 16:03:04,010 INFO L168 Benchmark]: Toolchain (without parser) took 10928.00 ms. Allocated memory was 90.2 MB in the beginning and 243.3 MB in the end (delta: 153.1 MB). Free memory was 49.0 MB in the beginning and 81.0 MB in the end (delta: -32.0 MB). Peak memory consumption was 122.9 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,010 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 90.2 MB. Free memory is still 46.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 16:03:04,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.21 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 48.9 MB in the beginning and 60.0 MB in the end (delta: -11.2 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.59 ms. Allocated memory is still 113.2 MB. Free memory was 60.0 MB in the beginning and 56.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,010 INFO L168 Benchmark]: Boogie Preprocessor took 67.05 ms. Allocated memory is still 113.2 MB. Free memory was 56.3 MB in the beginning and 53.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,011 INFO L168 Benchmark]: RCFGBuilder took 568.35 ms. Allocated memory was 113.2 MB in the beginning and 138.4 MB in the end (delta: 25.2 MB). Free memory was 53.2 MB in the beginning and 70.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,011 INFO L168 Benchmark]: TraceAbstraction took 9284.37 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 70.0 MB in the beginning and 92.6 MB in the end (delta: -22.5 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,011 INFO L168 Benchmark]: Witness Printer took 83.48 ms. Allocated memory is still 243.3 MB. Free memory was 92.6 MB in the beginning and 81.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-06 16:03:04,012 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.21 ms. Allocated memory is still 90.2 MB. Free memory is still 46.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 843.21 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 48.9 MB in the beginning and 60.0 MB in the end (delta: -11.2 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.59 ms. Allocated memory is still 113.2 MB. Free memory was 60.0 MB in the beginning and 56.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.05 ms. Allocated memory is still 113.2 MB. Free memory was 56.3 MB in the beginning and 53.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 568.35 ms. Allocated memory was 113.2 MB in the beginning and 138.4 MB in the end (delta: 25.2 MB). Free memory was 53.2 MB in the beginning and 70.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9284.37 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 70.0 MB in the beginning and 92.6 MB in the end (delta: -22.5 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.1 GB. * Witness Printer took 83.48 ms. Allocated memory is still 243.3 MB. Free memory was 92.6 MB in the beginning and 81.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * 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: 6264]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6264]: 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 1 procedures, 69 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1763 SDtfs, 1203 SDslu, 2533 SDs, 0 SdLazy, 272 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 487 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=15, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1501 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 93 NumberOfFragments, 731 HoareAnnotationTreeSize, 23 FomulaSimplifications, 55284 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 5037 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1306 NumberOfCodeBlocks, 1293 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3739 SizeOfPredicates, 58 NumberOfNonLiveVariables, 5821 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 238/278 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 2 specifications checked. All of them hold - InvariantResult [Line: 5905]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6244]: Loop Invariant [2021-11-06 16:03:04,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((ldv_module_refcounter == 1 && \result == 0) && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && 0 == \result) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) || ((((((((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module && 1 <= \result) && 2 <= ldv_module_refcounter) && \result <= 1) && 1 <= \result) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && ldv_module_refcounter <= 2) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 1]: Loop Invariant [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && 1 <= \result) && \result <= 1) && 1 <= \result) && tmp <= 1) && tmp___0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && 1 <= tmp) && ldv_retval_0 == 0) && !(0 == (module + module) % 18446744073709551616) - InvariantResult [Line: 6138]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6314]: Loop Invariant [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,044 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((ldv_module_refcounter == 1 && \result == 0) && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) || ((((((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module && 2 <= ldv_module_refcounter) && 1 <= \result) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && ldv_module_refcounter <= 2) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0) - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6376]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6362]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 5894]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 5905]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 5894]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5913]: Loop Invariant [2021-11-06 16:03:04,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 16:03:04,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((ldv_module_refcounter == 1 && #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] == module) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos]][#memory_$Pointer$[pppox_protos][protocol * 8 + pppox_protos] + 16]) && ldv_retval_0 == 0 - InvariantResult [Line: 5931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6393]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 5931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6106]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5931]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-06 16:03:04,075 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE