./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 791161d1 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.2-?-791161d [2022-07-23 00:38:04,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:38:04,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:38:04,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:38:04,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:38:04,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:38:04,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:38:04,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:38:04,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:38:04,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:38:04,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:38:04,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:38:04,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:38:04,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:38:04,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:38:04,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:38:04,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:38:04,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:38:04,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:38:04,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:38:04,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:38:04,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:38:04,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:38:04,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:38:04,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:38:04,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:38:04,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:38:04,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:38:04,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:38:04,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:38:04,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:38:04,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:38:04,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:38:04,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:38:04,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:38:04,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:38:04,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:38:04,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:38:04,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:38:04,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:38:04,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:38:04,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:38:04,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:38:04,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:38:04,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:38:04,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:38:04,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:38:04,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:38:04,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:38:04,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:38:04,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:38:04,153 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:38:04,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:38:04,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:38:04,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:38:04,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:38:04,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:38:04,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:38:04,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:38:04,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:38:04,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:38:04,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:38:04,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:38:04,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:38:04,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:38:04,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:38:04,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:38:04,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:38:04,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:38:04,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:38:04,157 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:38:04,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:38:04,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:38:04,157 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 [2022-07-23 00:38:04,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:38:04,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:38:04,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:38:04,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:38:04,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:38:04,366 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 [2022-07-23 00:38:04,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0fd362a/6363dcf1bdfc4a9a864be3ad592644ef/FLAG4257312f0 [2022-07-23 00:38:04,918 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:38:04,919 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 [2022-07-23 00:38:04,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0fd362a/6363dcf1bdfc4a9a864be3ad592644ef/FLAG4257312f0 [2022-07-23 00:38:05,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0fd362a/6363dcf1bdfc4a9a864be3ad592644ef [2022-07-23 00:38:05,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:38:05,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:38:05,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:38:05,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:38:05,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:38:05,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:38:05" (1/1) ... [2022-07-23 00:38:05,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e6fc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:05, skipping insertion in model container [2022-07-23 00:38:05,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:38:05" (1/1) ... [2022-07-23 00:38:05,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:38:05,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:38:05,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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] [2022-07-23 00:38:05,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:38:06,009 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:38:06,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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] [2022-07-23 00:38:06,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:38:06,225 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:38:06,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06 WrapperNode [2022-07-23 00:38:06,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:38:06,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:38:06,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:38:06,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:38:06,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,287 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2022-07-23 00:38:06,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:38:06,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:38:06,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:38:06,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:38:06,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:38:06,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:38:06,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:38:06,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:38:06,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (1/1) ... [2022-07-23 00:38:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:38:06,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:06,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 00:38:06,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 00:38:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:38:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:38:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:38:06,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:38:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:38:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 00:38:06,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-23 00:38:06,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:38:06,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:38:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 00:38:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 00:38:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:38:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:38:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:38:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:38:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:38:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:38:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-23 00:38:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-23 00:38:06,571 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:38:06,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:38:06,658 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:38:06,890 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:38:06,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:38:06,895 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:38:06,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:38:06 BoogieIcfgContainer [2022-07-23 00:38:06,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:38:06,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:38:06,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:38:06,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:38:06,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:38:05" (1/3) ... [2022-07-23 00:38:06,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245a47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:38:06, skipping insertion in model container [2022-07-23 00:38:06,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:38:06" (2/3) ... [2022-07-23 00:38:06,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245a47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:38:06, skipping insertion in model container [2022-07-23 00:38:06,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:38:06" (3/3) ... [2022-07-23 00:38:06,905 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2022-07-23 00:38:06,917 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:38:06,918 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:38:06,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:38:06,999 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56ca982a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61b94ab [2022-07-23 00:38:07,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:38:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-23 00:38:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 00:38:07,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:07,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:07,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:07,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2022-07-23 00:38:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:07,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921906959] [2022-07-23 00:38:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 00:38:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:07,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921906959] [2022-07-23 00:38:07,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921906959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:07,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:07,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:38:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192245619] [2022-07-23 00:38:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:07,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:38:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:38:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:38:07,458 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:07,575 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-07-23 00:38:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:38:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-07-23 00:38:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:07,584 INFO L225 Difference]: With dead ends: 181 [2022-07-23 00:38:07,585 INFO L226 Difference]: Without dead ends: 85 [2022-07-23 00:38:07,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:07,591 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:07,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-23 00:38:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-23 00:38:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-23 00:38:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2022-07-23 00:38:07,633 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2022-07-23 00:38:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:07,633 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-07-23 00:38:07,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-07-23 00:38:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 00:38:07,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:07,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:38:07,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2022-07-23 00:38:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375296636] [2022-07-23 00:38:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 00:38:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:07,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375296636] [2022-07-23 00:38:07,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375296636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:07,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:07,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:38:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248826048] [2022-07-23 00:38:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:38:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:38:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:07,822 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:07,929 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-07-23 00:38:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:38:07,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-07-23 00:38:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:07,931 INFO L225 Difference]: With dead ends: 179 [2022-07-23 00:38:07,931 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 00:38:07,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:07,932 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:07,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 369 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 00:38:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-07-23 00:38:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-23 00:38:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2022-07-23 00:38:07,941 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2022-07-23 00:38:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:07,942 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2022-07-23 00:38:07,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2022-07-23 00:38:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 00:38:07,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:07,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:38:07,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2022-07-23 00:38:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164824182] [2022-07-23 00:38:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 00:38:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:08,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164824182] [2022-07-23 00:38:08,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164824182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:08,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:08,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:38:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380025106] [2022-07-23 00:38:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:38:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:38:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:08,076 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:08,143 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2022-07-23 00:38:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:38:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-07-23 00:38:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:08,144 INFO L225 Difference]: With dead ends: 135 [2022-07-23 00:38:08,144 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 00:38:08,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:38:08,146 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:08,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 249 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 00:38:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-07-23 00:38:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 105 states have internal predecessors, (142), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-23 00:38:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2022-07-23 00:38:08,153 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2022-07-23 00:38:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:08,154 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2022-07-23 00:38:08,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2022-07-23 00:38:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 00:38:08,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:08,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:08,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:38:08,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2022-07-23 00:38:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:08,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205780013] [2022-07-23 00:38:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 00:38:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205780013] [2022-07-23 00:38:08,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205780013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:08,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:08,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:38:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820864940] [2022-07-23 00:38:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:08,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:38:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:38:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:08,274 INFO L87 Difference]: Start difference. First operand 121 states and 160 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:08,368 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2022-07-23 00:38:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:38:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2022-07-23 00:38:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:08,370 INFO L225 Difference]: With dead ends: 304 [2022-07-23 00:38:08,370 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 00:38:08,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:38:08,372 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:08,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 360 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 00:38:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2022-07-23 00:38:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 181 states have internal predecessors, (251), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2022-07-23 00:38:08,381 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2022-07-23 00:38:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:08,382 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2022-07-23 00:38:08,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2022-07-23 00:38:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 00:38:08,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:08,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:08,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:38:08,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2022-07-23 00:38:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993841111] [2022-07-23 00:38:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 00:38:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993841111] [2022-07-23 00:38:08,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993841111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:08,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:38:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53307818] [2022-07-23 00:38:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:38:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:38:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:08,483 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:08,548 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2022-07-23 00:38:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:38:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2022-07-23 00:38:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:08,550 INFO L225 Difference]: With dead ends: 443 [2022-07-23 00:38:08,550 INFO L226 Difference]: Without dead ends: 272 [2022-07-23 00:38:08,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:38:08,551 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:08,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 246 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-23 00:38:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2022-07-23 00:38:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.3958333333333333) internal successors, (335), 241 states have internal predecessors, (335), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2022-07-23 00:38:08,561 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2022-07-23 00:38:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:08,561 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2022-07-23 00:38:08,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2022-07-23 00:38:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-23 00:38:08,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:08,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:08,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:38:08,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2022-07-23 00:38:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622910543] [2022-07-23 00:38:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:38:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-23 00:38:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622910543] [2022-07-23 00:38:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622910543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328901281] [2022-07-23 00:38:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:08,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:08,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 00:38:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:08,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 00:38:08,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-23 00:38:09,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:38:09,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328901281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:09,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:38:09,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-07-23 00:38:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124564061] [2022-07-23 00:38:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:09,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:38:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:09,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:38:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:38:09,034 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:09,053 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2022-07-23 00:38:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:38:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 81 [2022-07-23 00:38:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:09,055 INFO L225 Difference]: With dead ends: 504 [2022-07-23 00:38:09,055 INFO L226 Difference]: Without dead ends: 262 [2022-07-23 00:38:09,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:38:09,056 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:09,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-23 00:38:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-23 00:38:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 242 states have internal predecessors, (336), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2022-07-23 00:38:09,064 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2022-07-23 00:38:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:09,064 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2022-07-23 00:38:09,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2022-07-23 00:38:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 00:38:09,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:09,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:09,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 00:38:09,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-23 00:38:09,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2022-07-23 00:38:09,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:09,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706132006] [2022-07-23 00:38:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 00:38:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706132006] [2022-07-23 00:38:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706132006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210982255] [2022-07-23 00:38:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:09,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 00:38:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:09,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 00:38:09,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-23 00:38:09,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:38:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210982255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:09,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:38:09,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-23 00:38:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800203105] [2022-07-23 00:38:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:09,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:38:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:38:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:38:09,682 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:09,717 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2022-07-23 00:38:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:38:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2022-07-23 00:38:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:09,719 INFO L225 Difference]: With dead ends: 825 [2022-07-23 00:38:09,720 INFO L226 Difference]: Without dead ends: 594 [2022-07-23 00:38:09,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-23 00:38:09,721 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 224 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:09,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-23 00:38:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2022-07-23 00:38:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 248 states have internal predecessors, (340), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2022-07-23 00:38:09,730 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2022-07-23 00:38:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:09,731 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2022-07-23 00:38:09,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2022-07-23 00:38:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 00:38:09,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:09,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:09,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 00:38:09,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-23 00:38:09,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2022-07-23 00:38:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:09,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701630889] [2022-07-23 00:38:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 00:38:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701630889] [2022-07-23 00:38:10,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701630889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517422622] [2022-07-23 00:38:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:10,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:10,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:10,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:10,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 00:38:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 00:38:10,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-23 00:38:10,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:38:10,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517422622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:10,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:38:10,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-23 00:38:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815816799] [2022-07-23 00:38:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:10,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:38:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:10,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:38:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:10,317 INFO L87 Difference]: Start difference. First operand 268 states and 362 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:10,332 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2022-07-23 00:38:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:38:10,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2022-07-23 00:38:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:10,336 INFO L225 Difference]: With dead ends: 643 [2022-07-23 00:38:10,336 INFO L226 Difference]: Without dead ends: 406 [2022-07-23 00:38:10,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:10,337 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:10,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-07-23 00:38:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2022-07-23 00:38:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 238 states have (on average 1.3739495798319328) internal successors, (327), 239 states have internal predecessors, (327), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-23 00:38:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2022-07-23 00:38:10,347 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2022-07-23 00:38:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:10,348 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2022-07-23 00:38:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2022-07-23 00:38:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-23 00:38:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:10,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:10,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 00:38:10,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:10,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2022-07-23 00:38:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:10,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082199457] [2022-07-23 00:38:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-23 00:38:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:10,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082199457] [2022-07-23 00:38:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082199457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:10,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:38:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065099873] [2022-07-23 00:38:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:38:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:38:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:38:10,731 INFO L87 Difference]: Start difference. First operand 255 states and 345 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:10,872 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2022-07-23 00:38:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:38:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2022-07-23 00:38:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:10,876 INFO L225 Difference]: With dead ends: 384 [2022-07-23 00:38:10,876 INFO L226 Difference]: Without dead ends: 381 [2022-07-23 00:38:10,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:38:10,878 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:10,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 617 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-23 00:38:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2022-07-23 00:38:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.388101983002833) internal successors, (490), 354 states have internal predecessors, (490), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-23 00:38:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2022-07-23 00:38:10,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2022-07-23 00:38:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:10,914 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2022-07-23 00:38:10,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 00:38:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2022-07-23 00:38:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-23 00:38:10,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:10,916 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 00:38:10,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2022-07-23 00:38:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:10,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70628063] [2022-07-23 00:38:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-23 00:38:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70628063] [2022-07-23 00:38:11,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70628063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:11,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:11,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:38:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750909602] [2022-07-23 00:38:11,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:11,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:38:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:11,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:38:11,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:38:11,011 INFO L87 Difference]: Start difference. First operand 374 states and 514 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:11,090 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2022-07-23 00:38:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:38:11,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2022-07-23 00:38:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:11,093 INFO L225 Difference]: With dead ends: 773 [2022-07-23 00:38:11,093 INFO L226 Difference]: Without dead ends: 525 [2022-07-23 00:38:11,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:38:11,094 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:11,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 541 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-23 00:38:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2022-07-23 00:38:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3767705382436262) internal successors, (486), 354 states have internal predecessors, (486), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-23 00:38:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2022-07-23 00:38:11,109 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2022-07-23 00:38:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:11,109 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2022-07-23 00:38:11,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2022-07-23 00:38:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-23 00:38:11,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:11,110 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:11,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 00:38:11,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2022-07-23 00:38:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:11,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674941967] [2022-07-23 00:38:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-23 00:38:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:11,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674941967] [2022-07-23 00:38:11,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674941967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:11,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:11,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 00:38:11,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143212216] [2022-07-23 00:38:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:11,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 00:38:11,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:11,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 00:38:11,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:11,248 INFO L87 Difference]: Start difference. First operand 374 states and 510 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:11,386 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2022-07-23 00:38:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:38:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2022-07-23 00:38:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:11,389 INFO L225 Difference]: With dead ends: 940 [2022-07-23 00:38:11,389 INFO L226 Difference]: Without dead ends: 692 [2022-07-23 00:38:11,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:38:11,390 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:11,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 730 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-07-23 00:38:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2022-07-23 00:38:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 354 states have internal predecessors, (482), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-23 00:38:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2022-07-23 00:38:11,405 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2022-07-23 00:38:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:11,405 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2022-07-23 00:38:11,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-23 00:38:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2022-07-23 00:38:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-23 00:38:11,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:11,406 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:11,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 00:38:11,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2022-07-23 00:38:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:11,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044179462] [2022-07-23 00:38:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:11,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:38:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 00:38:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 00:38:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044179462] [2022-07-23 00:38:11,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044179462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:11,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950177960] [2022-07-23 00:38:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:11,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:11,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 00:38:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:11,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 00:38:11,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 00:38:11,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:38:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 00:38:11,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950177960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:38:11,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:38:11,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-23 00:38:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737811313] [2022-07-23 00:38:11,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:38:11,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 00:38:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 00:38:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-23 00:38:11,909 INFO L87 Difference]: Start difference. First operand 374 states and 506 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 00:38:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:12,148 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2022-07-23 00:38:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:38:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-07-23 00:38:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:12,150 INFO L225 Difference]: With dead ends: 739 [2022-07-23 00:38:12,150 INFO L226 Difference]: Without dead ends: 381 [2022-07-23 00:38:12,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:38:12,151 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 77 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:12,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 362 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-23 00:38:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-07-23 00:38:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 358 states have (on average 1.3603351955307263) internal successors, (487), 361 states have internal predecessors, (487), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-23 00:38:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2022-07-23 00:38:12,166 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2022-07-23 00:38:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:12,166 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2022-07-23 00:38:12,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 00:38:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2022-07-23 00:38:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-23 00:38:12,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:12,168 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:12,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 00:38:12,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:12,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2022-07-23 00:38:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920251433] [2022-07-23 00:38:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 00:38:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 00:38:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 00:38:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:12,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920251433] [2022-07-23 00:38:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920251433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:12,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:12,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 00:38:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271854758] [2022-07-23 00:38:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 00:38:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 00:38:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:38:12,561 INFO L87 Difference]: Start difference. First operand 381 states and 513 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 00:38:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:12,754 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2022-07-23 00:38:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:38:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2022-07-23 00:38:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:12,757 INFO L225 Difference]: With dead ends: 964 [2022-07-23 00:38:12,757 INFO L226 Difference]: Without dead ends: 617 [2022-07-23 00:38:12,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-23 00:38:12,758 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:12,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 784 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-23 00:38:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2022-07-23 00:38:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 370 states have (on average 1.3486486486486486) internal successors, (499), 373 states have internal predecessors, (499), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-23 00:38:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2022-07-23 00:38:12,776 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2022-07-23 00:38:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:12,776 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2022-07-23 00:38:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 00:38:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2022-07-23 00:38:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-23 00:38:12,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:12,777 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:12,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 00:38:12,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2022-07-23 00:38:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:12,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750696742] [2022-07-23 00:38:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 00:38:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 00:38:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 00:38:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750696742] [2022-07-23 00:38:13,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750696742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346782718] [2022-07-23 00:38:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:13,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:13,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:13,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 00:38:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 00:38:14,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:14,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 00:38:14,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2022-07-23 00:38:14,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 00:38:14,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2022-07-23 00:38:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 00:38:14,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:38:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346782718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:14,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:38:14,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2022-07-23 00:38:14,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625428670] [2022-07-23 00:38:14,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:14,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:38:14,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:38:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-07-23 00:38:14,385 INFO L87 Difference]: Start difference. First operand 393 states and 525 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 00:38:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:14,599 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2022-07-23 00:38:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:38:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2022-07-23 00:38:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:14,602 INFO L225 Difference]: With dead ends: 870 [2022-07-23 00:38:14,602 INFO L226 Difference]: Without dead ends: 602 [2022-07-23 00:38:14,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2022-07-23 00:38:14,603 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:14,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1114 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-07-23 00:38:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2022-07-23 00:38:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 266 states have internal predecessors, (348), 12 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2022-07-23 00:38:14,621 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2022-07-23 00:38:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:14,622 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2022-07-23 00:38:14,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 00:38:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2022-07-23 00:38:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 00:38:14,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:14,624 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:14,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 00:38:14,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-23 00:38:14,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2022-07-23 00:38:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:14,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669439592] [2022-07-23 00:38:14,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 00:38:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 00:38:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-23 00:38:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:15,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669439592] [2022-07-23 00:38:15,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669439592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:15,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:38:15,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 00:38:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080482339] [2022-07-23 00:38:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:15,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 00:38:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 00:38:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:38:15,003 INFO L87 Difference]: Start difference. First operand 284 states and 370 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 00:38:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:15,156 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2022-07-23 00:38:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 00:38:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 107 [2022-07-23 00:38:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:15,158 INFO L225 Difference]: With dead ends: 286 [2022-07-23 00:38:15,158 INFO L226 Difference]: Without dead ends: 279 [2022-07-23 00:38:15,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:38:15,159 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 190 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:15,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 275 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:38:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-23 00:38:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-07-23 00:38:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 00:38:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2022-07-23 00:38:15,174 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2022-07-23 00:38:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:15,174 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2022-07-23 00:38:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 00:38:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2022-07-23 00:38:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-23 00:38:15,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:38:15,175 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:15,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 00:38:15,176 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:38:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:38:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2022-07-23 00:38:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:38:15,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514087065] [2022-07-23 00:38:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:38:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:38:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:38:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:38:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:38:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:38:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 00:38:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 00:38:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 00:38:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:38:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514087065] [2022-07-23 00:38:15,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514087065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:38:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320861077] [2022-07-23 00:38:15,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:38:15,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:38:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:38:15,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:38:15,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 00:38:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:38:15,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 00:38:15,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:38:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 00:38:15,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:38:15,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320861077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:38:15,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:38:15,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-23 00:38:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601906645] [2022-07-23 00:38:15,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:38:15,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:38:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:38:15,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:38:15,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:15,559 INFO L87 Difference]: Start difference. First operand 279 states and 361 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-23 00:38:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:38:15,592 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2022-07-23 00:38:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:38:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2022-07-23 00:38:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:38:15,593 INFO L225 Difference]: With dead ends: 279 [2022-07-23 00:38:15,593 INFO L226 Difference]: Without dead ends: 0 [2022-07-23 00:38:15,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:38:15,594 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 73 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:38:15,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:38:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-23 00:38:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-23 00:38:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 00:38:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 00:38:15,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-07-23 00:38:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:38:15,596 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 00:38:15,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-23 00:38:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-23 00:38:15,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-23 00:38:15,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-23 00:38:15,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-23 00:38:15,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 00:38:15,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-23 00:38:17,682 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L895 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L902 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L895 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2022-07-23 00:38:17,683 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L895 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)) [2022-07-23 00:38:17,684 INFO L895 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L895 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1))))))) [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,684 INFO L902 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2022-07-23 00:38:17,684 INFO L895 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (<= ~ldv_module_refcounter~0 2) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2022-07-23 00:38:17,684 INFO L895 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0))))) [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6397(lines 6396 6398) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6150(lines 6146 6152) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,685 INFO L895 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))))) [2022-07-23 00:38:17,685 INFO L899 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2022-07-23 00:38:17,685 INFO L902 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2022-07-23 00:38:17,686 INFO L895 garLoopResultBuilder]: At program point L6134(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L895 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)) [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L895 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,686 INFO L902 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L902 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2022-07-23 00:38:17,686 INFO L899 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L895 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L902 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L895 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)) [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L899 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2022-07-23 00:38:17,687 INFO L895 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2022-07-23 00:38:17,688 INFO L899 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2022-07-23 00:38:17,688 INFO L895 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2022-07-23 00:38:17,688 INFO L899 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2022-07-23 00:38:17,688 INFO L899 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2022-07-23 00:38:17,688 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-23 00:38:17,688 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,688 INFO L895 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2022-07-23 00:38:17,688 INFO L899 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2022-07-23 00:38:17,688 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2022-07-23 00:38:17,689 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,689 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-07-23 00:38:17,691 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:38:17,693 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 00:38:17,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 12:38:17 BoogieIcfgContainer [2022-07-23 00:38:17,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 00:38:17,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 00:38:17,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 00:38:17,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 00:38:17,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:38:06" (3/4) ... [2022-07-23 00:38:17,756 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-23 00:38:17,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-23 00:38:17,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-23 00:38:17,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2022-07-23 00:38:17,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-07-23 00:38:17,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-23 00:38:17,762 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2022-07-23 00:38:17,762 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-07-23 00:38:17,773 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-07-23 00:38:17,773 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-23 00:38:17,774 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-23 00:38:17,774 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-23 00:38:17,799 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result [2022-07-23 00:38:17,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) [2022-07-23 00:38:17,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_module_refcounter == 1 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) [2022-07-23 00:38:17,833 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 00:38:17,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 00:38:17,834 INFO L158 Benchmark]: Toolchain (without parser) took 12632.81ms. Allocated memory was 109.1MB in the beginning and 377.5MB in the end (delta: 268.4MB). Free memory was 73.6MB in the beginning and 145.0MB in the end (delta: -71.4MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,834 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 00:38:17,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1023.97ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 73.4MB in the beginning and 84.8MB in the end (delta: -11.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.80ms. Allocated memory is still 132.1MB. Free memory was 84.8MB in the beginning and 81.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,835 INFO L158 Benchmark]: Boogie Preprocessor took 74.44ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 77.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,835 INFO L158 Benchmark]: RCFGBuilder took 532.56ms. Allocated memory is still 132.1MB. Free memory was 77.9MB in the beginning and 52.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,835 INFO L158 Benchmark]: TraceAbstraction took 10855.30ms. Allocated memory was 132.1MB in the beginning and 377.5MB in the end (delta: 245.4MB). Free memory was 51.9MB in the beginning and 152.3MB in the end (delta: -100.4MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,836 INFO L158 Benchmark]: Witness Printer took 80.11ms. Allocated memory is still 377.5MB. Free memory was 152.3MB in the beginning and 145.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 00:38:17,841 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.17ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1023.97ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 73.4MB in the beginning and 84.8MB in the end (delta: -11.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.80ms. Allocated memory is still 132.1MB. Free memory was 84.8MB in the beginning and 81.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.44ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 77.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.56ms. Allocated memory is still 132.1MB. Free memory was 77.9MB in the beginning and 52.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10855.30ms. Allocated memory was 132.1MB in the beginning and 377.5MB in the end (delta: 245.4MB). Free memory was 51.9MB in the beginning and 152.3MB in the end (delta: -100.4MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. * Witness Printer took 80.11ms. Allocated memory is still 377.5MB. Free memory was 152.3MB in the beginning and 145.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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 * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1827 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1814 mSDsluCounter, 7115 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5144 mSDsCounter, 350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1147 IncrementalHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 350 mSolverCounterUnsat, 1971 mSDtfsCounter, 1147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 913 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 171 PreInvPairs, 242 NumberOfFragments, 973 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24915 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47270 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2015 ConstructedInterpolants, 0 QuantifiedInterpolants, 5504 SizeOfPredicates, 41 NumberOfNonLiveVariables, 5310 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 822/896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6244]: Loop Invariant [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,870 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) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) - InvariantResult [Line: 6396]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6146]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - 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 [2022-07-23 00:38:17,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,876 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 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) - InvariantResult [Line: 6252]: Loop Invariant [2022-07-23 00:38:17,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,882 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 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: 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: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5913]: Loop Invariant [2022-07-23 00:38:17,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-23 00:38:17,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-23 00:38:17,889 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][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_retval_0 == 0 - InvariantResult [Line: 5929]: 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: 6106]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 RESULT: Ultimate proved your program to be correct! [2022-07-23 00:38:17,912 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