./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 6c24879c 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-?-6c24879 [2022-07-12 13:21:45,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:21:45,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:21:45,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:21:45,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:21:45,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:21:45,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:21:45,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:21:45,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:21:45,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:21:45,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:21:45,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:21:45,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:21:45,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:21:45,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:21:45,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:21:45,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:21:45,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:21:45,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:21:45,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:21:45,317 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:21:45,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:21:45,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:21:45,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:21:45,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:21:45,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:21:45,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:21:45,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:21:45,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:21:45,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:21:45,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:21:45,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:21:45,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:21:45,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:21:45,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:21:45,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:21:45,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:21:45,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:21:45,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:21:45,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:21:45,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:21:45,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:21:45,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:21:45,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:21:45,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:21:45,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:21:45,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:21:45,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:21:45,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:21:45,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:21:45,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:21:45,375 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:21:45,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:21:45,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:21:45,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:21:45,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:21:45,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:21:45,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:21:45,379 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-12 13:21:45,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:21:45,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:21:45,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:21:45,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:21:45,679 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:21:45,680 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-12 13:21:45,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0c7a41/c625cbf2a44a4bd8b7565a3e764a9aa9/FLAGf75090eef [2022-07-12 13:21:46,507 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:21:46,508 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-12 13:21:46,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0c7a41/c625cbf2a44a4bd8b7565a3e764a9aa9/FLAGf75090eef [2022-07-12 13:21:46,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0c7a41/c625cbf2a44a4bd8b7565a3e764a9aa9 [2022-07-12 13:21:46,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:21:46,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:21:46,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:21:46,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:21:46,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:21:46,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:21:46" (1/1) ... [2022-07-12 13:21:46,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530b9603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:46, skipping insertion in model container [2022-07-12 13:21:46,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:21:46" (1/1) ... [2022-07-12 13:21:46,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:21:46,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:21:47,652 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-12 13:21:47,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:21:47,766 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:21:47,924 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-12 13:21:47,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:21:47,970 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:21:47,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47 WrapperNode [2022-07-12 13:21:47,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:21:47,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:21:47,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:21:47,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:21:47,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,058 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2022-07-12 13:21:48,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:21:48,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:21:48,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:21:48,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:21:48,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:21:48,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:21:48,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:21:48,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:21:48,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (1/1) ... [2022-07-12 13:21:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:21:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:48,221 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-12 13:21:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:21:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:21:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:21:48,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:21:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:21:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:21:48,261 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:21:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:21:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-12 13:21:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-12 13:21:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:21:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:21:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:21:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:21:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:21:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:21:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:21:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:21:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:21:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:21:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:21:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:21:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-12 13:21:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-12 13:21:48,234 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-12 13:21:48,484 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:21:48,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:21:48,576 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:21:48,836 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:21:48,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:21:48,841 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:21:48,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:21:48 BoogieIcfgContainer [2022-07-12 13:21:48,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:21:48,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:21:48,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:21:48,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:21:48,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:21:46" (1/3) ... [2022-07-12 13:21:48,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69832abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:21:48, skipping insertion in model container [2022-07-12 13:21:48,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:21:47" (2/3) ... [2022-07-12 13:21:48,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69832abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:21:48, skipping insertion in model container [2022-07-12 13:21:48,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:21:48" (3/3) ... [2022-07-12 13:21:48,850 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-12 13:21:48,862 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:21:48,863 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:21:48,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:21:48,909 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@4985f54d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bd51b49 [2022-07-12 13:21:48,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:21:48,913 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-12 13:21:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 13:21:48,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:48,922 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-12 13:21:48,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2022-07-12 13:21:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:48,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111147090] [2022-07-12 13:21:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,380 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-12 13:21:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111147090] [2022-07-12 13:21:49,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111147090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:49,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:49,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:21:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946181616] [2022-07-12 13:21:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:21:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:49,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:21:49,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:21:49,412 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-12 13:21:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:49,511 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-07-12 13:21:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:21:49,513 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-12 13:21:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:49,522 INFO L225 Difference]: With dead ends: 181 [2022-07-12 13:21:49,522 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 13:21:49,525 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-12 13:21:49,528 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 13:21:49,529 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-12 13:21:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 13:21:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-12 13:21:49,571 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-12 13:21:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2022-07-12 13:21:49,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2022-07-12 13:21:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:49,574 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-07-12 13:21:49,575 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-12 13:21:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-07-12 13:21:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 13:21:49,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:49,577 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-12 13:21:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:21:49,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2022-07-12 13:21:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:49,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142540806] [2022-07-12 13:21:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:49,765 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-12 13:21:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142540806] [2022-07-12 13:21:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142540806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:49,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:21:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909843303] [2022-07-12 13:21:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:49,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:21:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:21:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:21:49,771 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-12 13:21:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:50,002 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-07-12 13:21:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:21:50,003 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-12 13:21:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:50,008 INFO L225 Difference]: With dead ends: 179 [2022-07-12 13:21:50,009 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 13:21:50,010 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-12 13:21:50,012 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:21:50,013 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.2s Time] [2022-07-12 13:21:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 13:21:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-07-12 13:21:50,026 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-12 13:21:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2022-07-12 13:21:50,028 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2022-07-12 13:21:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:50,029 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2022-07-12 13:21:50,029 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-12 13:21:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2022-07-12 13:21:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 13:21:50,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:50,032 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-12 13:21:50,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:21:50,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2022-07-12 13:21:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:50,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132377172] [2022-07-12 13:21:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,274 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-12 13:21:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132377172] [2022-07-12 13:21:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132377172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:50,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:21:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951656192] [2022-07-12 13:21:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:21:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:21:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:21:50,279 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-12 13:21:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:50,390 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2022-07-12 13:21:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:21:50,390 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-12 13:21:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:50,392 INFO L225 Difference]: With dead ends: 135 [2022-07-12 13:21:50,392 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 13:21:50,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:21:50,394 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:21:50,394 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.1s Time] [2022-07-12 13:21:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 13:21:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-07-12 13:21:50,415 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-12 13:21:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2022-07-12 13:21:50,421 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2022-07-12 13:21:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:50,422 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2022-07-12 13:21:50,423 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-12 13:21:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2022-07-12 13:21:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 13:21:50,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:50,425 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-12 13:21:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:21:50,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2022-07-12 13:21:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091651098] [2022-07-12 13:21:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,679 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-12 13:21:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091651098] [2022-07-12 13:21:50,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091651098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:50,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:50,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:21:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968638872] [2022-07-12 13:21:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:21:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:21:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:21:50,683 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-12 13:21:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:50,817 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2022-07-12 13:21:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:21:50,818 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-12 13:21:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:50,820 INFO L225 Difference]: With dead ends: 304 [2022-07-12 13:21:50,821 INFO L226 Difference]: Without dead ends: 209 [2022-07-12 13:21:50,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:21:50,822 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-12 13:21:50,823 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-12 13:21:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-12 13:21:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2022-07-12 13:21:50,841 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-12 13:21:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2022-07-12 13:21:50,843 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2022-07-12 13:21:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:50,844 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2022-07-12 13:21:50,844 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-12 13:21:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2022-07-12 13:21:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 13:21:50,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:50,849 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-12 13:21:50,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:21:50,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2022-07-12 13:21:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:50,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276581195] [2022-07-12 13:21:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,047 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-12 13:21:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276581195] [2022-07-12 13:21:51,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276581195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:51,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:51,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:21:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007957552] [2022-07-12 13:21:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:51,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:21:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:51,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:21:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:21:51,051 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-12 13:21:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:51,168 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2022-07-12 13:21:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:21:51,169 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-12 13:21:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:51,177 INFO L225 Difference]: With dead ends: 443 [2022-07-12 13:21:51,177 INFO L226 Difference]: Without dead ends: 272 [2022-07-12 13:21:51,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:21:51,181 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:21:51,182 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.1s Time] [2022-07-12 13:21:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-12 13:21:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2022-07-12 13:21:51,213 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-12 13:21:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2022-07-12 13:21:51,215 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2022-07-12 13:21:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:51,217 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2022-07-12 13:21:51,217 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-12 13:21:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2022-07-12 13:21:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 13:21:51,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:51,219 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-12 13:21:51,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:21:51,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2022-07-12 13:21:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901656380] [2022-07-12 13:21:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 13:21:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,466 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-12 13:21:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901656380] [2022-07-12 13:21:51,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901656380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:21:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331968573] [2022-07-12 13:21:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:21:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:51,475 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-12 13:21:51,504 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-12 13:21:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:51,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 13:21:51,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:21:51,797 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-12 13:21:51,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:21:51,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331968573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:51,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:21:51,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-07-12 13:21:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421611918] [2022-07-12 13:21:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:51,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:21:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:21:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:21:51,800 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-12 13:21:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:51,833 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2022-07-12 13:21:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:21:51,834 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-12 13:21:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:51,838 INFO L225 Difference]: With dead ends: 504 [2022-07-12 13:21:51,838 INFO L226 Difference]: Without dead ends: 262 [2022-07-12 13:21:51,842 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-12 13:21:51,844 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-12 13:21:51,844 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-12 13:21:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-12 13:21:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-12 13:21:51,857 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-12 13:21:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2022-07-12 13:21:51,861 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2022-07-12 13:21:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:51,861 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2022-07-12 13:21:51,862 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-12 13:21:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2022-07-12 13:21:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 13:21:51,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:51,865 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-12 13:21:51,897 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-12 13:21:52,083 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-12 13:21:52,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2022-07-12 13:21:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443893807] [2022-07-12 13:21:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,347 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-12 13:21:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443893807] [2022-07-12 13:21:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443893807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:21:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248219992] [2022-07-12 13:21:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:21:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:52,349 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-12 13:21:52,376 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-12 13:21:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:52,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 13:21:52,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:21:52,630 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-12 13:21:52,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:21:52,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248219992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:52,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:21:52,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-12 13:21:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808323510] [2022-07-12 13:21:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:52,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:21:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:21:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:21:52,634 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-12 13:21:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:52,690 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2022-07-12 13:21:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:21:52,691 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-12 13:21:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:52,694 INFO L225 Difference]: With dead ends: 825 [2022-07-12 13:21:52,695 INFO L226 Difference]: Without dead ends: 594 [2022-07-12 13:21:52,696 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-12 13:21:52,697 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-12 13:21:52,697 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-12 13:21:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-12 13:21:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2022-07-12 13:21:52,713 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-12 13:21:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2022-07-12 13:21:52,715 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2022-07-12 13:21:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:52,715 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2022-07-12 13:21:52,715 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-12 13:21:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2022-07-12 13:21:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 13:21:52,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:52,717 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-12 13:21:52,750 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-12 13:21:52,943 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-12 13:21:52,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2022-07-12 13:21:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:52,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73618104] [2022-07-12 13:21:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,101 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-12 13:21:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73618104] [2022-07-12 13:21:53,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73618104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:21:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25476584] [2022-07-12 13:21:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:21:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:53,105 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-12 13:21:53,125 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-12 13:21:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 13:21:53,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:21:53,365 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-12 13:21:53,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:21:53,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25476584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:53,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:21:53,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 13:21:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576626243] [2022-07-12 13:21:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:53,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:21:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:21:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:21:53,369 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-12 13:21:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:53,393 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2022-07-12 13:21:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:21:53,394 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-12 13:21:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:53,398 INFO L225 Difference]: With dead ends: 643 [2022-07-12 13:21:53,398 INFO L226 Difference]: Without dead ends: 406 [2022-07-12 13:21:53,399 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-12 13:21:53,400 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-12 13:21:53,400 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-12 13:21:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-07-12 13:21:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2022-07-12 13:21:53,416 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-12 13:21:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2022-07-12 13:21:53,417 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2022-07-12 13:21:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:53,419 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2022-07-12 13:21:53,419 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-12 13:21:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2022-07-12 13:21:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 13:21:53,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:53,421 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-12 13:21:53,452 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-12 13:21:53,643 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-12 13:21:53,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2022-07-12 13:21:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777328480] [2022-07-12 13:21:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:53,856 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-12 13:21:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:53,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777328480] [2022-07-12 13:21:53,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777328480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:53,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:53,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:21:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646185005] [2022-07-12 13:21:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:53,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:21:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:21:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:21:53,860 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-12 13:21:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:54,060 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2022-07-12 13:21:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:21:54,061 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-12 13:21:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:54,065 INFO L225 Difference]: With dead ends: 384 [2022-07-12 13:21:54,065 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 13:21:54,066 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-12 13:21:54,068 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-12 13:21:54,068 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-12 13:21:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 13:21:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2022-07-12 13:21:54,090 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-12 13:21:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2022-07-12 13:21:54,093 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2022-07-12 13:21:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:54,094 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2022-07-12 13:21:54,094 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-12 13:21:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2022-07-12 13:21:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 13:21:54,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:54,096 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-12 13:21:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:21:54,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2022-07-12 13:21:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:54,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165279383] [2022-07-12 13:21:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,253 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-12 13:21:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:54,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165279383] [2022-07-12 13:21:54,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165279383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:54,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:54,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:21:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718413546] [2022-07-12 13:21:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:54,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:21:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:21:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:21:54,256 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-12 13:21:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:54,368 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2022-07-12 13:21:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:21:54,369 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-12 13:21:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:54,372 INFO L225 Difference]: With dead ends: 773 [2022-07-12 13:21:54,373 INFO L226 Difference]: Without dead ends: 525 [2022-07-12 13:21:54,374 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-12 13:21:54,375 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 13:21:54,376 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-12 13:21:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-12 13:21:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2022-07-12 13:21:54,397 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-12 13:21:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2022-07-12 13:21:54,399 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2022-07-12 13:21:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:54,400 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2022-07-12 13:21:54,400 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-12 13:21:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2022-07-12 13:21:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 13:21:54,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:54,402 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-12 13:21:54,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 13:21:54,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2022-07-12 13:21:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:54,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062447154] [2022-07-12 13:21:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,593 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-12 13:21:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062447154] [2022-07-12 13:21:54,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062447154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:54,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:54,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:21:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648795296] [2022-07-12 13:21:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:54,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:21:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:54,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:21:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:21:54,596 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-12 13:21:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:54,792 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2022-07-12 13:21:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:21:54,793 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-12 13:21:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:54,797 INFO L225 Difference]: With dead ends: 940 [2022-07-12 13:21:54,797 INFO L226 Difference]: Without dead ends: 692 [2022-07-12 13:21:54,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:21:54,799 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-12 13:21:54,799 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-12 13:21:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-07-12 13:21:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2022-07-12 13:21:54,829 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-12 13:21:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2022-07-12 13:21:54,831 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2022-07-12 13:21:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:54,832 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2022-07-12 13:21:54,832 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-12 13:21:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2022-07-12 13:21:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 13:21:54,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:54,834 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-12 13:21:54,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 13:21:54,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2022-07-12 13:21:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:54,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478587937] [2022-07-12 13:21:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 13:21:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 13:21:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:55,086 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-12 13:21:55,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:55,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478587937] [2022-07-12 13:21:55,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478587937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:21:55,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416965096] [2022-07-12 13:21:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:55,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:21:55,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:55,092 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-12 13:21:55,094 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-12 13:21:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:55,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 13:21:55,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:21:55,416 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-12 13:21:55,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:21:55,605 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-12 13:21:55,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416965096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:21:55,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:21:55,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-12 13:21:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722818964] [2022-07-12 13:21:55,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:21:55,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 13:21:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 13:21:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:21:55,607 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-12 13:21:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:55,945 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2022-07-12 13:21:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:21:55,946 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-12 13:21:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:55,948 INFO L225 Difference]: With dead ends: 739 [2022-07-12 13:21:55,949 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 13:21:55,950 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-12 13:21:55,950 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 77 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:21:55,951 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.2s Time] [2022-07-12 13:21:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 13:21:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-07-12 13:21:55,970 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-12 13:21:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2022-07-12 13:21:55,972 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2022-07-12 13:21:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:55,973 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2022-07-12 13:21:55,973 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-12 13:21:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2022-07-12 13:21:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 13:21:55,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:55,975 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-12 13:21:56,002 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-12 13:21:56,195 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-12 13:21:56,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:56,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2022-07-12 13:21:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:56,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738205081] [2022-07-12 13:21:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 13:21:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 13:21:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:56,472 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-12 13:21:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738205081] [2022-07-12 13:21:56,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738205081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:56,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:56,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:21:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417279133] [2022-07-12 13:21:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:56,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:21:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:21:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:21:56,475 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-12 13:21:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:56,762 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2022-07-12 13:21:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:21:56,763 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-12 13:21:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:56,767 INFO L225 Difference]: With dead ends: 964 [2022-07-12 13:21:56,768 INFO L226 Difference]: Without dead ends: 617 [2022-07-12 13:21:56,769 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-12 13:21:56,770 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:21:56,770 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.2s Time] [2022-07-12 13:21:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-12 13:21:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2022-07-12 13:21:56,795 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-12 13:21:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2022-07-12 13:21:56,797 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2022-07-12 13:21:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:56,798 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2022-07-12 13:21:56,798 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-12 13:21:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2022-07-12 13:21:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 13:21:56,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:56,800 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-12 13:21:56,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 13:21:56,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2022-07-12 13:21:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:56,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713270739] [2022-07-12 13:21:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 13:21:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 13:21:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:58,233 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-12 13:21:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:58,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713270739] [2022-07-12 13:21:58,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713270739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:21:58,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201411221] [2022-07-12 13:21:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:21:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:21:58,236 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-12 13:21:58,238 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-12 13:21:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:58,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 13:21:58,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:21:58,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 13:21:58,892 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-12 13:21:58,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 13:21:58,907 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-12 13:21:59,053 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-12 13:21:59,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:21:59,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201411221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:59,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:21:59,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2022-07-12 13:21:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134650607] [2022-07-12 13:21:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:59,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:21:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:21:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-07-12 13:21:59,056 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-12 13:21:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:59,283 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2022-07-12 13:21:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:21:59,283 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-12 13:21:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:59,286 INFO L225 Difference]: With dead ends: 870 [2022-07-12 13:21:59,286 INFO L226 Difference]: Without dead ends: 602 [2022-07-12 13:21:59,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 13:21:59,288 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 13:21:59,288 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-12 13:21:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-07-12 13:21:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2022-07-12 13:21:59,315 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-12 13:21:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2022-07-12 13:21:59,316 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2022-07-12 13:21:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:21:59,317 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2022-07-12 13:21:59,317 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-12 13:21:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2022-07-12 13:21:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 13:21:59,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:21:59,319 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-12 13:21:59,349 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-12 13:21:59,539 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-12 13:21:59,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:21:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:21:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2022-07-12 13:21:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:21:59,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203786400] [2022-07-12 13:21:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:21:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:21:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:21:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:21:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:21:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:21:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:21:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 13:21:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 13:21:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:21:59,750 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-12 13:21:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:21:59,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203786400] [2022-07-12 13:21:59,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203786400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:21:59,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:21:59,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 13:21:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664787547] [2022-07-12 13:21:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:21:59,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 13:21:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:21:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 13:21:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:21:59,753 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-12 13:21:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:21:59,977 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2022-07-12 13:21:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 13:21:59,978 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-12 13:21:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:21:59,979 INFO L225 Difference]: With dead ends: 286 [2022-07-12 13:21:59,980 INFO L226 Difference]: Without dead ends: 279 [2022-07-12 13:21:59,982 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-12 13:21:59,983 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-12 13:21:59,983 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-12 13:21:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-12 13:22:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-07-12 13:22:00,007 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-12 13:22:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2022-07-12 13:22:00,010 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2022-07-12 13:22:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:22:00,011 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2022-07-12 13:22:00,011 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-12 13:22:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2022-07-12 13:22:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 13:22:00,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:22:00,013 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-12 13:22:00,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 13:22:00,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:22:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:22:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2022-07-12 13:22:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:22:00,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111224126] [2022-07-12 13:22:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:22:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:22:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:22:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:22:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:22:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:22:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:22:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:22:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:22:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 13:22:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 13:22:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,219 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-12 13:22:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:22:00,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111224126] [2022-07-12 13:22:00,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111224126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:22:00,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198109757] [2022-07-12 13:22:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:22:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:22:00,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:22:00,222 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-12 13:22:00,223 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-12 13:22:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:22:00,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 13:22:00,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:22:00,549 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-12 13:22:00,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:22:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198109757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:22:00,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:22:00,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-12 13:22:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34374324] [2022-07-12 13:22:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:22:00,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:22:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:22:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:22:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:22:00,551 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-12 13:22:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:22:00,605 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2022-07-12 13:22:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:22:00,606 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-12 13:22:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:22:00,606 INFO L225 Difference]: With dead ends: 279 [2022-07-12 13:22:00,606 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 13:22:00,607 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-12 13:22:00,608 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-12 13:22:00,608 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-12 13:22:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 13:22:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 13:22:00,610 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-12 13:22:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 13:22:00,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-07-12 13:22:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:22:00,610 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 13:22:00,611 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-12 13:22:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 13:22:00,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 13:22:00,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 13:22:00,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:22:00,831 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-12 13:22:00,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 13:22:03,672 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2022-07-12 13:22:03,673 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-12 13:22:03,673 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2022-07-12 13:22:03,673 INFO L902 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2022-07-12 13:22:03,673 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2022-07-12 13:22:03,673 INFO L899 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2022-07-12 13:22:03,673 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-12 13:22:03,673 INFO L899 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2022-07-12 13:22:03,674 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-07-12 13:22:03,674 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-12 13:22:03,675 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-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2022-07-12 13:22:03,675 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-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2022-07-12 13:22:03,675 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2022-07-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2022-07-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2022-07-12 13:22:03,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,675 INFO L902 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2022-07-12 13:22:03,676 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-12 13:22:03,676 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-12 13:22:03,676 INFO L899 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2022-07-12 13:22:03,676 INFO L899 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2022-07-12 13:22:03,676 INFO L899 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2022-07-12 13:22:03,676 INFO L895 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2022-07-12 13:22:03,676 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-12 13:22:03,676 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-07-12 13:22:03,676 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2022-07-12 13:22:03,676 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-12 13:22:03,676 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-12 13:22:03,677 INFO L899 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2022-07-12 13:22:03,677 INFO L899 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2022-07-12 13:22:03,677 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-12 13:22:03,677 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-07-12 13:22:03,677 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-12 13:22:03,677 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-12 13:22:03,677 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-12 13:22:03,677 INFO L899 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2022-07-12 13:22:03,677 INFO L902 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2022-07-12 13:22:03,678 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-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2022-07-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2022-07-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2022-07-12 13:22:03,678 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-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2022-07-12 13:22:03,678 INFO L899 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2022-07-12 13:22:03,679 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-12 13:22:03,679 INFO L902 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2022-07-12 13:22:03,679 INFO L899 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2022-07-12 13:22:03,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,679 INFO L902 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2022-07-12 13:22:03,679 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2022-07-12 13:22:03,679 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2022-07-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2022-07-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2022-07-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2022-07-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2022-07-12 13:22:03,680 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-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2022-07-12 13:22:03,680 INFO L902 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2022-07-12 13:22:03,680 INFO L899 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2022-07-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2022-07-12 13:22:03,681 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-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2022-07-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2022-07-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2022-07-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2022-07-12 13:22:03,681 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-12 13:22:03,681 INFO L899 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2022-07-12 13:22:03,682 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-12 13:22:03,682 INFO L899 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2022-07-12 13:22:03,682 INFO L899 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2022-07-12 13:22:03,682 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-12 13:22:03,682 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,682 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-12 13:22:03,682 INFO L899 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2022-07-12 13:22:03,683 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-12 13:22:03,683 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,683 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-07-12 13:22:03,686 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:22:03,688 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 13:22:03,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:22:03 BoogieIcfgContainer [2022-07-12 13:22:03,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 13:22:03,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 13:22:03,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 13:22:03,735 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 13:22:03,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:21:48" (3/4) ... [2022-07-12 13:22:03,738 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 13:22:03,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-12 13:22:03,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-12 13:22:03,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2022-07-12 13:22:03,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-07-12 13:22:03,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 13:22:03,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2022-07-12 13:22:03,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-07-12 13:22:03,754 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-07-12 13:22:03,756 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 13:22:03,756 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 13:22:03,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 13:22:03,795 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-12 13:22:03,795 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-12 13:22:03,795 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-12 13:22:03,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 13:22:03,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 13:22:03,868 INFO L158 Benchmark]: Toolchain (without parser) took 17251.31ms. Allocated memory was 111.1MB in the beginning and 285.2MB in the end (delta: 174.1MB). Free memory was 67.6MB in the beginning and 78.2MB in the end (delta: -10.6MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,868 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 47.4MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 13:22:03,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1354.18ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 67.4MB in the beginning and 62.9MB in the end (delta: 4.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.26ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 59.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,869 INFO L158 Benchmark]: Boogie Preprocessor took 106.45ms. Allocated memory is still 140.5MB. Free memory was 59.2MB in the beginning and 95.0MB in the end (delta: -35.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,869 INFO L158 Benchmark]: RCFGBuilder took 674.01ms. Allocated memory is still 140.5MB. Free memory was 94.4MB in the beginning and 69.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,870 INFO L158 Benchmark]: TraceAbstraction took 14889.21ms. Allocated memory was 140.5MB in the beginning and 285.2MB in the end (delta: 144.7MB). Free memory was 68.5MB in the beginning and 85.6MB in the end (delta: -17.1MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,870 INFO L158 Benchmark]: Witness Printer took 132.07ms. Allocated memory is still 285.2MB. Free memory was 85.6MB in the beginning and 78.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 13:22:03,877 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.33ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 47.4MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1354.18ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 67.4MB in the beginning and 62.9MB in the end (delta: 4.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.26ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 59.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.45ms. Allocated memory is still 140.5MB. Free memory was 59.2MB in the beginning and 95.0MB in the end (delta: -35.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * RCFGBuilder took 674.01ms. Allocated memory is still 140.5MB. Free memory was 94.4MB in the beginning and 69.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14889.21ms. Allocated memory was 140.5MB in the beginning and 285.2MB in the end (delta: 144.7MB). Free memory was 68.5MB in the beginning and 85.6MB in the end (delta: -17.1MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. * Witness Printer took 132.07ms. Allocated memory is still 285.2MB. Free memory was 85.6MB in the beginning and 78.2MB 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: 14.8s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1827 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1814 mSDsluCounter, 7115 SdHoareTripleChecker+Invalid, 1.1s 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.8s 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 171 PreInvPairs, 242 NumberOfFragments, 973 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24915 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47270 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.7s 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-12 13:22:03,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,924 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-12 13:22:03,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,936 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-12 13:22:03,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,946 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-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 13:22:03,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 13:22:03,950 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-12 13:22:03,977 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