./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:15:03,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:15:03,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:15:03,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:15:03,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:15:03,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:15:03,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:15:03,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:15:03,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:15:03,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:15:03,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:15:03,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:15:03,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:15:03,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:15:03,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:15:03,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:15:03,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:15:03,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:15:03,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:15:03,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:15:03,415 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:15:03,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:15:03,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:15:03,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:15:03,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:15:03,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:15:03,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:15:03,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:15:03,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:15:03,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:15:03,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:15:03,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:15:03,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:15:03,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:15:03,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:15:03,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:15:03,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:15:03,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:15:03,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:15:03,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:15:03,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:15:03,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:15:03,443 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:15:03,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:15:03,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:15:03,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:15:03,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:15:03,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:15:03,464 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:15:03,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:15:03,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:15:03,465 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:15:03,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:15:03,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:15:03,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:15:03,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:15:03,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:15:03,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:15:03,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:15:03,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:15:03,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:15:03,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:15:03,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:15:03,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:15:03,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:15:03,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:15:03,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:15:03,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:15:03,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:15:03,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:15:03,471 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:15:03,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:15:03,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:15:03,471 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2022-07-14 00:15:03,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:15:03,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:15:03,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:15:03,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:15:03,705 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:15:03,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-14 00:15:03,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1711c9c/c5db8a5ca25447b6ae35d5bf5d210f36/FLAG66beaaafe [2022-07-14 00:15:04,389 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:15:04,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-14 00:15:04,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1711c9c/c5db8a5ca25447b6ae35d5bf5d210f36/FLAG66beaaafe [2022-07-14 00:15:04,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1711c9c/c5db8a5ca25447b6ae35d5bf5d210f36 [2022-07-14 00:15:04,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:15:04,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:15:04,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:15:04,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:15:04,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:15:04,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:15:04" (1/1) ... [2022-07-14 00:15:04,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a5762a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:04, skipping insertion in model container [2022-07-14 00:15:04,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:15:04" (1/1) ... [2022-07-14 00:15:04,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:15:04,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:15:05,397 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-07-14 00:15:05,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:15:05,803 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:15:05,933 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-07-14 00:15:06,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:15:06,121 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:15:06,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06 WrapperNode [2022-07-14 00:15:06,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:15:06,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:15:06,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:15:06,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:15:06,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,277 INFO L137 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2426 [2022-07-14 00:15:06,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:15:06,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:15:06,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:15:06,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:15:06,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:15:06,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:15:06,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:15:06,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:15:06,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (1/1) ... [2022-07-14 00:15:06,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:15:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:15:06,476 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-14 00:15:06,482 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-14 00:15:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-14 00:15:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-14 00:15:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:15:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2022-07-14 00:15:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2022-07-14 00:15:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-14 00:15:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-14 00:15:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:15:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:15:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:15:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:15:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:15:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2022-07-14 00:15:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2022-07-14 00:15:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2022-07-14 00:15:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2022-07-14 00:15:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-14 00:15:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-14 00:15:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:15:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:15:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-14 00:15:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-14 00:15:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:15:06,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:15:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2022-07-14 00:15:06,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2022-07-14 00:15:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 00:15:06,513 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 00:15:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-14 00:15:06,513 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-14 00:15:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-14 00:15:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-14 00:15:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-14 00:15:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-14 00:15:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:15:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:15:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:15:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:15:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:15:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:15:06,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:15:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 00:15:06,515 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 00:15:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:15:06,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:15:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2022-07-14 00:15:06,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2022-07-14 00:15:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:15:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2022-07-14 00:15:06,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2022-07-14 00:15:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-14 00:15:06,516 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-14 00:15:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 00:15:06,517 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 00:15:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:15:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:15:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:15:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-14 00:15:06,518 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-14 00:15:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2022-07-14 00:15:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2022-07-14 00:15:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-14 00:15:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-14 00:15:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-14 00:15:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-14 00:15:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 00:15:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 00:15:06,521 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2022-07-14 00:15:06,521 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2022-07-14 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-14 00:15:06,521 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-14 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:15:06,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:15:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-14 00:15:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-14 00:15:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:15:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:15:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2022-07-14 00:15:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2022-07-14 00:15:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-14 00:15:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-14 00:15:07,005 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:15:07,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:15:07,462 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:15:10,586 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:15:10,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:15:10,606 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 00:15:10,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:15:10 BoogieIcfgContainer [2022-07-14 00:15:10,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:15:10,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:15:10,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:15:10,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:15:10,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:15:04" (1/3) ... [2022-07-14 00:15:10,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f728653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:15:10, skipping insertion in model container [2022-07-14 00:15:10,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:15:06" (2/3) ... [2022-07-14 00:15:10,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f728653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:15:10, skipping insertion in model container [2022-07-14 00:15:10,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:15:10" (3/3) ... [2022-07-14 00:15:10,619 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-14 00:15:10,632 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:15:10,633 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:15:10,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:15:10,704 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@355dd98f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75e79a1b [2022-07-14 00:15:10,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:15:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-14 00:15:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 00:15:10,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:10,722 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:10,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1070293405, now seen corresponding path program 1 times [2022-07-14 00:15:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280622865] [2022-07-14 00:15:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-14 00:15:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:11,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280622865] [2022-07-14 00:15:11,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280622865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:11,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:11,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:15:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876354924] [2022-07-14 00:15:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:11,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:15:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:15:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:15:11,197 INFO L87 Difference]: Start difference. First operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:15:14,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:17,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:17,144 INFO L93 Difference]: Finished difference Result 2318 states and 3473 transitions. [2022-07-14 00:15:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:15:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-07-14 00:15:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:17,168 INFO L225 Difference]: With dead ends: 2318 [2022-07-14 00:15:17,168 INFO L226 Difference]: Without dead ends: 1560 [2022-07-14 00:15:17,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:15:17,183 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 1446 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 305 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:17,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 2223 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 886 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-07-14 00:15:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-07-14 00:15:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1388. [2022-07-14 00:15:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-07-14 00:15:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2001 transitions. [2022-07-14 00:15:17,345 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2001 transitions. Word has length 78 [2022-07-14 00:15:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:17,347 INFO L495 AbstractCegarLoop]: Abstraction has 1388 states and 2001 transitions. [2022-07-14 00:15:17,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:15:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2001 transitions. [2022-07-14 00:15:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 00:15:17,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:17,357 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:17,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:15:17,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 192122725, now seen corresponding path program 1 times [2022-07-14 00:15:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:17,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027414221] [2022-07-14 00:15:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-14 00:15:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:17,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027414221] [2022-07-14 00:15:17,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027414221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:17,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:17,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:15:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39286559] [2022-07-14 00:15:17,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:17,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:15:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:15:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:15:17,574 INFO L87 Difference]: Start difference. First operand 1388 states and 2001 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:15:21,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:23,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:23,741 INFO L93 Difference]: Finished difference Result 4449 states and 6499 transitions. [2022-07-14 00:15:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:15:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-14 00:15:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:23,760 INFO L225 Difference]: With dead ends: 4449 [2022-07-14 00:15:23,760 INFO L226 Difference]: Without dead ends: 3079 [2022-07-14 00:15:23,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:15:23,767 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1479 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 317 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 3544 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 3544 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1867 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-14 00:15:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2022-07-14 00:15:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 2815. [2022-07-14 00:15:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-07-14 00:15:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4094 transitions. [2022-07-14 00:15:23,891 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4094 transitions. Word has length 82 [2022-07-14 00:15:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:23,893 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 4094 transitions. [2022-07-14 00:15:23,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:15:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4094 transitions. [2022-07-14 00:15:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-14 00:15:23,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:23,902 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:15:23,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 793541372, now seen corresponding path program 1 times [2022-07-14 00:15:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758342611] [2022-07-14 00:15:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 00:15:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:15:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:15:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:15:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-14 00:15:24,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:24,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758342611] [2022-07-14 00:15:24,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758342611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:24,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:24,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:15:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634075331] [2022-07-14 00:15:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:15:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:15:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:15:24,273 INFO L87 Difference]: Start difference. First operand 2815 states and 4094 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:15:28,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:28,490 INFO L93 Difference]: Finished difference Result 7425 states and 10845 transitions. [2022-07-14 00:15:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:15:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2022-07-14 00:15:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:28,521 INFO L225 Difference]: With dead ends: 7425 [2022-07-14 00:15:28,521 INFO L226 Difference]: Without dead ends: 4634 [2022-07-14 00:15:28,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:15:28,532 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 1923 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 760 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:28,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 2386 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 1344 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 00:15:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2022-07-14 00:15:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4145. [2022-07-14 00:15:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 3305 states have (on average 1.4338880484114978) internal successors, (4739), 3359 states have internal predecessors, (4739), 605 states have call successors, (605), 213 states have call predecessors, (605), 234 states have return successors, (680), 610 states have call predecessors, (680), 604 states have call successors, (680) [2022-07-14 00:15:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6024 transitions. [2022-07-14 00:15:28,692 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6024 transitions. Word has length 140 [2022-07-14 00:15:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:28,694 INFO L495 AbstractCegarLoop]: Abstraction has 4145 states and 6024 transitions. [2022-07-14 00:15:28,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:15:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6024 transitions. [2022-07-14 00:15:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 00:15:28,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:28,709 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:28,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:15:28,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -850191257, now seen corresponding path program 1 times [2022-07-14 00:15:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855628108] [2022-07-14 00:15:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:15:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:15:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:15:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:15:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:15:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:15:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 00:15:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:15:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:15:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-14 00:15:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855628108] [2022-07-14 00:15:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855628108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:29,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:15:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575306616] [2022-07-14 00:15:29,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:29,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:15:29,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:15:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:15:29,009 INFO L87 Difference]: Start difference. First operand 4145 states and 6024 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:15:33,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:35,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:37,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:39,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:39,378 INFO L93 Difference]: Finished difference Result 10898 states and 15785 transitions. [2022-07-14 00:15:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:15:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 169 [2022-07-14 00:15:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:39,412 INFO L225 Difference]: With dead ends: 10898 [2022-07-14 00:15:39,413 INFO L226 Difference]: Without dead ends: 6777 [2022-07-14 00:15:39,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:15:39,425 INFO L413 NwaCegarLoop]: 1491 mSDtfsCounter, 1567 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 536 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 3418 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:39,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 3418 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1431 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2022-07-14 00:15:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6777 states. [2022-07-14 00:15:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6777 to 6142. [2022-07-14 00:15:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 4931 states have (on average 1.4232407219630907) internal successors, (7018), 5015 states have internal predecessors, (7018), 840 states have call successors, (840), 335 states have call predecessors, (840), 370 states have return successors, (961), 851 states have call predecessors, (961), 839 states have call successors, (961) [2022-07-14 00:15:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 8819 transitions. [2022-07-14 00:15:39,672 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 8819 transitions. Word has length 169 [2022-07-14 00:15:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:39,672 INFO L495 AbstractCegarLoop]: Abstraction has 6142 states and 8819 transitions. [2022-07-14 00:15:39,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:15:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 8819 transitions. [2022-07-14 00:15:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-14 00:15:39,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:39,695 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:15:39,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1242981819, now seen corresponding path program 1 times [2022-07-14 00:15:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819685617] [2022-07-14 00:15:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:15:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:15:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 00:15:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:15:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:15:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:15:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-07-14 00:15:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:39,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819685617] [2022-07-14 00:15:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819685617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:39,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:15:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991484612] [2022-07-14 00:15:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:15:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:15:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:15:39,908 INFO L87 Difference]: Start difference. First operand 6142 states and 8819 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:15:44,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:46,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:46,363 INFO L93 Difference]: Finished difference Result 15902 states and 22823 transitions. [2022-07-14 00:15:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:15:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2022-07-14 00:15:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:46,413 INFO L225 Difference]: With dead ends: 15902 [2022-07-14 00:15:46,413 INFO L226 Difference]: Without dead ends: 9795 [2022-07-14 00:15:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:15:46,428 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 2814 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 1115 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2885 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:46,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2885 Valid, 2415 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 1453 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-14 00:15:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2022-07-14 00:15:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8838. [2022-07-14 00:15:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 7083 states have (on average 1.4126782436820555) internal successors, (10006), 7203 states have internal predecessors, (10006), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-14 00:15:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12522 transitions. [2022-07-14 00:15:46,795 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12522 transitions. Word has length 163 [2022-07-14 00:15:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:46,796 INFO L495 AbstractCegarLoop]: Abstraction has 8838 states and 12522 transitions. [2022-07-14 00:15:46,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:15:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12522 transitions. [2022-07-14 00:15:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 00:15:46,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:46,809 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:46,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:15:46,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2102218924, now seen corresponding path program 1 times [2022-07-14 00:15:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:46,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37245802] [2022-07-14 00:15:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:15:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:15:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:15:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:15:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:15:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:47,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:15:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-14 00:15:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:47,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37245802] [2022-07-14 00:15:47,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37245802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:15:47,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:15:47,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:15:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943059899] [2022-07-14 00:15:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:15:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:15:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:15:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:15:47,026 INFO L87 Difference]: Start difference. First operand 8838 states and 12522 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:15:51,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:53,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:15:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:15:53,232 INFO L93 Difference]: Finished difference Result 14382 states and 20599 transitions. [2022-07-14 00:15:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:15:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2022-07-14 00:15:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:15:53,275 INFO L225 Difference]: With dead ends: 14382 [2022-07-14 00:15:53,276 INFO L226 Difference]: Without dead ends: 9802 [2022-07-14 00:15:53,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:15:53,291 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 659 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 299 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:15:53,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 3210 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1655 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-07-14 00:15:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-07-14 00:15:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8858. [2022-07-14 00:15:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7103 states have (on average 1.4115162607349008) internal successors, (10026), 7223 states have internal predecessors, (10026), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-14 00:15:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 12542 transitions. [2022-07-14 00:15:53,604 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 12542 transitions. Word has length 168 [2022-07-14 00:15:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:15:53,604 INFO L495 AbstractCegarLoop]: Abstraction has 8858 states and 12542 transitions. [2022-07-14 00:15:53,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:15:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 12542 transitions. [2022-07-14 00:15:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-14 00:15:53,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:15:53,618 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:15:53,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:15:53,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:15:53,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:15:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1844834605, now seen corresponding path program 1 times [2022-07-14 00:15:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:15:53,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510987833] [2022-07-14 00:15:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:15:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:15:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:15:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:15:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:15:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:15:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:15:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:15:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:15:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:15:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:15:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:15:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:15:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:15:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:15:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:15:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:15:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 00:15:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-14 00:15:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:15:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510987833] [2022-07-14 00:15:54,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510987833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:15:54,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778818862] [2022-07-14 00:15:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:15:54,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:15:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:15:54,221 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-14 00:15:54,225 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-14 00:15:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:15:54,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 00:15:54,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:15:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-14 00:15:54,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:15:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-14 00:15:55,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778818862] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:15:55,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:15:55,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 17 [2022-07-14 00:15:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431727945] [2022-07-14 00:15:55,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:15:55,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 00:15:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:15:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 00:15:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:15:55,801 INFO L87 Difference]: Start difference. First operand 8858 states and 12542 transitions. Second operand has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-14 00:16:02,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:04,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:07,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:09,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:11,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:11,984 INFO L93 Difference]: Finished difference Result 24105 states and 34353 transitions. [2022-07-14 00:16:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 00:16:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) Word has length 170 [2022-07-14 00:16:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:12,037 INFO L225 Difference]: With dead ends: 24105 [2022-07-14 00:16:12,038 INFO L226 Difference]: Without dead ends: 15282 [2022-07-14 00:16:12,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 378 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1399, Unknown=0, NotChecked=0, Total=1806 [2022-07-14 00:16:12,060 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 4837 mSDsluCounter, 5449 mSDsCounter, 0 mSdLazyCounter, 6122 mSolverCounterSat, 1879 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4971 SdHoareTripleChecker+Valid, 6475 SdHoareTripleChecker+Invalid, 8006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1879 IncrementalHoareTripleChecker+Valid, 6122 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:12,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4971 Valid, 6475 Invalid, 8006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1879 Valid, 6122 Invalid, 5 Unknown, 0 Unchecked, 15.3s Time] [2022-07-14 00:16:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15282 states. [2022-07-14 00:16:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15282 to 13435. [2022-07-14 00:16:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13435 states, 10715 states have (on average 1.4011199253383109) internal successors, (15013), 10881 states have internal predecessors, (15013), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-14 00:16:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13435 states to 13435 states and 18852 transitions. [2022-07-14 00:16:12,544 INFO L78 Accepts]: Start accepts. Automaton has 13435 states and 18852 transitions. Word has length 170 [2022-07-14 00:16:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:12,544 INFO L495 AbstractCegarLoop]: Abstraction has 13435 states and 18852 transitions. [2022-07-14 00:16:12,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-14 00:16:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13435 states and 18852 transitions. [2022-07-14 00:16:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-14 00:16:12,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:12,626 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:12,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 00:16:12,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:12,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1828209139, now seen corresponding path program 1 times [2022-07-14 00:16:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:12,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196542748] [2022-07-14 00:16:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:16:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:16:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:16:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 00:16:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-14 00:16:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196542748] [2022-07-14 00:16:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196542748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:13,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:16:13,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:16:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199626485] [2022-07-14 00:16:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:13,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:16:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:16:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:16:13,041 INFO L87 Difference]: Start difference. First operand 13435 states and 18852 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:16:17,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:17,820 INFO L93 Difference]: Finished difference Result 33436 states and 46809 transitions. [2022-07-14 00:16:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:16:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 195 [2022-07-14 00:16:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:17,915 INFO L225 Difference]: With dead ends: 33436 [2022-07-14 00:16:17,915 INFO L226 Difference]: Without dead ends: 20036 [2022-07-14 00:16:17,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:16:17,957 INFO L413 NwaCegarLoop]: 1610 mSDtfsCounter, 1412 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 448 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:17,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 3703 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1882 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 00:16:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2022-07-14 00:16:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 13459. [2022-07-14 00:16:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13459 states, 10739 states have (on average 1.400223484495763) internal successors, (15037), 10905 states have internal predecessors, (15037), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-14 00:16:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 18876 transitions. [2022-07-14 00:16:18,730 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 18876 transitions. Word has length 195 [2022-07-14 00:16:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:18,731 INFO L495 AbstractCegarLoop]: Abstraction has 13459 states and 18876 transitions. [2022-07-14 00:16:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:16:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 18876 transitions. [2022-07-14 00:16:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-14 00:16:18,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:18,750 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:16:18,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1124632277, now seen corresponding path program 1 times [2022-07-14 00:16:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:18,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102884451] [2022-07-14 00:16:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:16:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:16:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:16:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 00:16:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-14 00:16:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102884451] [2022-07-14 00:16:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102884451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:19,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:16:19,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:16:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828359869] [2022-07-14 00:16:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:19,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:16:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:16:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:16:19,086 INFO L87 Difference]: Start difference. First operand 13459 states and 18876 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:16:23,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:25,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:27,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:28,243 INFO L93 Difference]: Finished difference Result 28371 states and 39874 transitions. [2022-07-14 00:16:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:16:28,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2022-07-14 00:16:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:28,306 INFO L225 Difference]: With dead ends: 28371 [2022-07-14 00:16:28,306 INFO L226 Difference]: Without dead ends: 14947 [2022-07-14 00:16:28,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:16:28,338 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 394 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:28,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 3880 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2326 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-07-14 00:16:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-07-14 00:16:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13507. [2022-07-14 00:16:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13507 states, 10775 states have (on average 1.3988863109048724) internal successors, (15073), 10941 states have internal predecessors, (15073), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-14 00:16:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13507 states to 13507 states and 18927 transitions. [2022-07-14 00:16:28,900 INFO L78 Accepts]: Start accepts. Automaton has 13507 states and 18927 transitions. Word has length 206 [2022-07-14 00:16:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:28,901 INFO L495 AbstractCegarLoop]: Abstraction has 13507 states and 18927 transitions. [2022-07-14 00:16:28,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:16:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13507 states and 18927 transitions. [2022-07-14 00:16:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-14 00:16:28,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:28,914 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:28,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:16:28,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -928227653, now seen corresponding path program 1 times [2022-07-14 00:16:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:28,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036725573] [2022-07-14 00:16:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:16:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:16:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:16:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 00:16:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-14 00:16:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:29,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036725573] [2022-07-14 00:16:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036725573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:16:29,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946033468] [2022-07-14 00:16:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:16:29,168 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-14 00:16:29,169 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-14 00:16:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:29,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:16:29,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:16:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-14 00:16:29,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:16:29,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946033468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:29,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:16:29,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-14 00:16:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246199107] [2022-07-14 00:16:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:29,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:16:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:16:29,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:16:29,626 INFO L87 Difference]: Start difference. First operand 13507 states and 18927 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:16:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:30,573 INFO L93 Difference]: Finished difference Result 33048 states and 46290 transitions. [2022-07-14 00:16:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:16:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 213 [2022-07-14 00:16:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:30,635 INFO L225 Difference]: With dead ends: 33048 [2022-07-14 00:16:30,635 INFO L226 Difference]: Without dead ends: 19576 [2022-07-14 00:16:30,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:16:30,659 INFO L413 NwaCegarLoop]: 1898 mSDtfsCounter, 1323 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 6119 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:30,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 6119 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:16:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2022-07-14 00:16:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 13519. [2022-07-14 00:16:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13519 states, 10787 states have (on average 1.3984425697598961) internal successors, (15085), 10941 states have internal predecessors, (15085), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-14 00:16:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13519 states to 13519 states and 18939 transitions. [2022-07-14 00:16:31,381 INFO L78 Accepts]: Start accepts. Automaton has 13519 states and 18939 transitions. Word has length 213 [2022-07-14 00:16:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:31,382 INFO L495 AbstractCegarLoop]: Abstraction has 13519 states and 18939 transitions. [2022-07-14 00:16:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:16:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13519 states and 18939 transitions. [2022-07-14 00:16:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-14 00:16:31,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:31,393 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:31,417 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-14 00:16:31,619 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,SelfDestructingSolverStorable9 [2022-07-14 00:16:31,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash -486438682, now seen corresponding path program 1 times [2022-07-14 00:16:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:31,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471152009] [2022-07-14 00:16:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 00:16:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:16:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 00:16:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:16:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:16:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:16:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:16:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 00:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:16:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:16:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-14 00:16:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471152009] [2022-07-14 00:16:31,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471152009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:16:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031665062] [2022-07-14 00:16:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:16:31,979 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-14 00:16:31,999 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-14 00:16:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:32,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:16:32,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:16:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-14 00:16:32,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:16:32,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031665062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:32,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:16:32,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-07-14 00:16:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59727812] [2022-07-14 00:16:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:16:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:16:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:16:32,700 INFO L87 Difference]: Start difference. First operand 13519 states and 18939 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-14 00:16:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:33,451 INFO L93 Difference]: Finished difference Result 18303 states and 25413 transitions. [2022-07-14 00:16:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:16:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 251 [2022-07-14 00:16:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:33,500 INFO L225 Difference]: With dead ends: 18303 [2022-07-14 00:16:33,500 INFO L226 Difference]: Without dead ends: 18294 [2022-07-14 00:16:33,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:16:33,508 INFO L413 NwaCegarLoop]: 1732 mSDtfsCounter, 1622 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:33,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 2318 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:16:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18294 states. [2022-07-14 00:16:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18294 to 16793. [2022-07-14 00:16:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 13347 states have (on average 1.386603731175545) internal successors, (18507), 13535 states have internal predecessors, (18507), 2278 states have call successors, (2278), 1080 states have call predecessors, (2278), 1167 states have return successors, (2584), 2321 states have call predecessors, (2584), 2277 states have call successors, (2584) [2022-07-14 00:16:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 23369 transitions. [2022-07-14 00:16:34,305 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 23369 transitions. Word has length 251 [2022-07-14 00:16:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:34,306 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 23369 transitions. [2022-07-14 00:16:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-14 00:16:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 23369 transitions. [2022-07-14 00:16:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-14 00:16:34,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:34,317 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:34,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 00:16:34,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:34,532 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1296230958, now seen corresponding path program 1 times [2022-07-14 00:16:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152625920] [2022-07-14 00:16:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 00:16:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:16:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 00:16:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:16:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:16:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:16:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:16:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 00:16:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:16:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:16:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-14 00:16:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152625920] [2022-07-14 00:16:34,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152625920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:34,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:16:34,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:16:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328913455] [2022-07-14 00:16:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:16:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:16:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:16:34,843 INFO L87 Difference]: Start difference. First operand 16793 states and 23369 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 00:16:37,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:39,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:40,379 INFO L93 Difference]: Finished difference Result 25950 states and 36184 transitions. [2022-07-14 00:16:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:16:40,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 255 [2022-07-14 00:16:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:40,405 INFO L225 Difference]: With dead ends: 25950 [2022-07-14 00:16:40,405 INFO L226 Difference]: Without dead ends: 8033 [2022-07-14 00:16:40,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:16:40,434 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1472 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 461 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:40,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1940 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 568 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 00:16:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2022-07-14 00:16:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 7346. [2022-07-14 00:16:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7346 states, 5820 states have (on average 1.3752577319587629) internal successors, (8004), 5903 states have internal predecessors, (8004), 999 states have call successors, (999), 486 states have call predecessors, (999), 526 states have return successors, (1142), 1022 states have call predecessors, (1142), 998 states have call successors, (1142) [2022-07-14 00:16:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10145 transitions. [2022-07-14 00:16:40,829 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10145 transitions. Word has length 255 [2022-07-14 00:16:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:40,830 INFO L495 AbstractCegarLoop]: Abstraction has 7346 states and 10145 transitions. [2022-07-14 00:16:40,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 00:16:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10145 transitions. [2022-07-14 00:16:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-14 00:16:40,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:40,838 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:40,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:16:40,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1689020113, now seen corresponding path program 1 times [2022-07-14 00:16:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882051575] [2022-07-14 00:16:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 00:16:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:16:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 00:16:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:16:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:16:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:16:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:16:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 00:16:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:16:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:16:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-14 00:16:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-14 00:16:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882051575] [2022-07-14 00:16:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882051575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:41,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:16:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 00:16:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665788717] [2022-07-14 00:16:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:41,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:16:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:16:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:16:41,286 INFO L87 Difference]: Start difference. First operand 7346 states and 10145 transitions. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 00:16:46,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:48,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:50,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:52,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:16:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:53,011 INFO L93 Difference]: Finished difference Result 17482 states and 24607 transitions. [2022-07-14 00:16:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:16:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 268 [2022-07-14 00:16:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:53,042 INFO L225 Difference]: With dead ends: 17482 [2022-07-14 00:16:53,042 INFO L226 Difference]: Without dead ends: 10217 [2022-07-14 00:16:53,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:16:53,061 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1812 mSDsluCounter, 6300 mSDsCounter, 0 mSdLazyCounter, 4590 mSolverCounterSat, 372 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 7503 SdHoareTripleChecker+Invalid, 4966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 4590 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:53,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 7503 Invalid, 4966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 4590 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2022-07-14 00:16:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2022-07-14 00:16:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 7416. [2022-07-14 00:16:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7416 states, 5880 states have (on average 1.3714285714285714) internal successors, (8064), 5963 states have internal predecessors, (8064), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-14 00:16:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 10215 transitions. [2022-07-14 00:16:53,490 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 10215 transitions. Word has length 268 [2022-07-14 00:16:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:53,490 INFO L495 AbstractCegarLoop]: Abstraction has 7416 states and 10215 transitions. [2022-07-14 00:16:53,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 00:16:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 10215 transitions. [2022-07-14 00:16:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-14 00:16:53,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:53,502 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:53,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 00:16:53,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1797631130, now seen corresponding path program 1 times [2022-07-14 00:16:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850155462] [2022-07-14 00:16:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:16:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:16:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:16:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:16:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:16:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:16:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:16:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:16:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 00:16:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:16:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:16:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-14 00:16:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:54,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850155462] [2022-07-14 00:16:54,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850155462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:16:54,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604331731] [2022-07-14 00:16:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:54,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:54,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:16:54,012 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-14 00:16:54,016 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-14 00:16:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:54,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 2286 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:16:54,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:16:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-14 00:16:54,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:16:54,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604331731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:54,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:16:54,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-14 00:16:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774290332] [2022-07-14 00:16:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:16:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:16:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:16:54,707 INFO L87 Difference]: Start difference. First operand 7416 states and 10215 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:16:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:16:55,097 INFO L93 Difference]: Finished difference Result 14801 states and 20390 transitions. [2022-07-14 00:16:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:16:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-14 00:16:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:16:55,119 INFO L225 Difference]: With dead ends: 14801 [2022-07-14 00:16:55,119 INFO L226 Difference]: Without dead ends: 7415 [2022-07-14 00:16:55,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:16:55,134 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 6 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:16:55,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4099 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:16:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2022-07-14 00:16:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 7415. [2022-07-14 00:16:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 5879 states have (on average 1.3711515563871406) internal successors, (8061), 5962 states have internal predecessors, (8061), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-14 00:16:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 10212 transitions. [2022-07-14 00:16:55,527 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 10212 transitions. Word has length 274 [2022-07-14 00:16:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:16:55,528 INFO L495 AbstractCegarLoop]: Abstraction has 7415 states and 10212 transitions. [2022-07-14 00:16:55,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:16:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 10212 transitions. [2022-07-14 00:16:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-14 00:16:55,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:16:55,534 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:16:55,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 00:16:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:55,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:16:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:16:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 925220568, now seen corresponding path program 1 times [2022-07-14 00:16:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:16:55,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271472279] [2022-07-14 00:16:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:16:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:16:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:16:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:16:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:16:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:16:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:16:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:16:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:16:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:16:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:16:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:16:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:16:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:16:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:16:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:16:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:16:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:16:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:16:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:16:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:16:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:16:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 00:16:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:16:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:16:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:16:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:16:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-14 00:16:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:16:56,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271472279] [2022-07-14 00:16:56,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271472279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:16:56,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114476097] [2022-07-14 00:16:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:16:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:16:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:16:56,113 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-14 00:16:56,139 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-14 00:16:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:16:56,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 00:16:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:16:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-07-14 00:16:56,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:16:56,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114476097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:16:56,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:16:56,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-14 00:16:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148085658] [2022-07-14 00:16:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:16:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:16:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:16:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:16:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:16:56,794 INFO L87 Difference]: Start difference. First operand 7415 states and 10212 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:16:59,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:01,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:17:01,828 INFO L93 Difference]: Finished difference Result 16478 states and 23122 transitions. [2022-07-14 00:17:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:17:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-14 00:17:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:17:01,851 INFO L225 Difference]: With dead ends: 16478 [2022-07-14 00:17:01,851 INFO L226 Difference]: Without dead ends: 9143 [2022-07-14 00:17:01,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:17:01,865 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 297 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:17:01,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 4650 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 00:17:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9143 states. [2022-07-14 00:17:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9143 to 7745. [2022-07-14 00:17:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 6191 states have (on average 1.3824907123243417) internal successors, (8559), 6274 states have internal predecessors, (8559), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 536 states have return successors, (1170), 1050 states have call predecessors, (1170), 1016 states have call successors, (1170) [2022-07-14 00:17:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 10746 transitions. [2022-07-14 00:17:02,280 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 10746 transitions. Word has length 274 [2022-07-14 00:17:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:17:02,280 INFO L495 AbstractCegarLoop]: Abstraction has 7745 states and 10746 transitions. [2022-07-14 00:17:02,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:17:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 10746 transitions. [2022-07-14 00:17:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-14 00:17:02,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:17:02,286 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:17:02,308 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-14 00:17:02,486 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,SelfDestructingSolverStorable14 [2022-07-14 00:17:02,487 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:17:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:17:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -132617510, now seen corresponding path program 1 times [2022-07-14 00:17:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:17:02,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630525536] [2022-07-14 00:17:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:17:02,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:17:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:17:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:17:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:17:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:17:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:17:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:17:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:17:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:17:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:17:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:17:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:17:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:17:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:17:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:17:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:17:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:17:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:17:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:17:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:17:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:17:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 00:17:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:17:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:17:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:17:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2022-07-14 00:17:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:17:02,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630525536] [2022-07-14 00:17:02,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630525536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:17:02,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:17:02,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 00:17:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181738019] [2022-07-14 00:17:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:17:02,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:17:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:17:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:17:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:17:02,946 INFO L87 Difference]: Start difference. First operand 7745 states and 10746 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:17:06,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:08,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:12,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:14,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:17:14,298 INFO L93 Difference]: Finished difference Result 18286 states and 25832 transitions. [2022-07-14 00:17:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:17:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-14 00:17:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:17:14,319 INFO L225 Difference]: With dead ends: 18286 [2022-07-14 00:17:14,319 INFO L226 Difference]: Without dead ends: 10621 [2022-07-14 00:17:14,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:17:14,328 INFO L413 NwaCegarLoop]: 1293 mSDtfsCounter, 1140 mSDsluCounter, 4499 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 431 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 5792 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:17:14,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 5792 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 2937 Invalid, 4 Unknown, 0 Unchecked, 10.7s Time] [2022-07-14 00:17:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2022-07-14 00:17:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 7781. [2022-07-14 00:17:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7781 states, 6221 states have (on average 1.3806461983603922) internal successors, (8589), 6304 states have internal predecessors, (8589), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 542 states have return successors, (1188), 1056 states have call predecessors, (1188), 1016 states have call successors, (1188) [2022-07-14 00:17:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7781 states to 7781 states and 10794 transitions. [2022-07-14 00:17:14,691 INFO L78 Accepts]: Start accepts. Automaton has 7781 states and 10794 transitions. Word has length 274 [2022-07-14 00:17:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:17:14,691 INFO L495 AbstractCegarLoop]: Abstraction has 7781 states and 10794 transitions. [2022-07-14 00:17:14,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-14 00:17:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 10794 transitions. [2022-07-14 00:17:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-14 00:17:14,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:17:14,698 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:17:14,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 00:17:14,698 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:17:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:17:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2052785736, now seen corresponding path program 1 times [2022-07-14 00:17:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:17:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128417761] [2022-07-14 00:17:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:17:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:17:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:17:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:17:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:17:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:17:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:17:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:17:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:17:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:17:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:17:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:17:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:17:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:17:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:17:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:17:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:17:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:17:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:17:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:17:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:17:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:17:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 00:17:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:17:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 00:17:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-14 00:17:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-07-14 00:17:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:17:15,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128417761] [2022-07-14 00:17:15,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128417761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:17:15,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:17:15,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 00:17:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566981889] [2022-07-14 00:17:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:17:15,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 00:17:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:17:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 00:17:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:17:15,305 INFO L87 Difference]: Start difference. First operand 7781 states and 10794 transitions. Second operand has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-14 00:17:21,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:23,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:27,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:29,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:32,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:34,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:17:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:17:34,206 INFO L93 Difference]: Finished difference Result 22431 states and 32470 transitions. [2022-07-14 00:17:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:17:34,207 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 275 [2022-07-14 00:17:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:17:34,246 INFO L225 Difference]: With dead ends: 22431 [2022-07-14 00:17:34,246 INFO L226 Difference]: Without dead ends: 14730 [2022-07-14 00:17:34,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-07-14 00:17:34,264 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 2071 mSDsluCounter, 13322 mSDsCounter, 0 mSdLazyCounter, 7951 mSolverCounterSat, 581 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 14863 SdHoareTripleChecker+Invalid, 8538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 7951 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:17:34,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 14863 Invalid, 8538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 7951 Invalid, 6 Unknown, 0 Unchecked, 17.8s Time] [2022-07-14 00:17:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-07-14 00:17:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 7811. [2022-07-14 00:17:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 6245 states have (on average 1.37822257806245) internal successors, (8607), 6328 states have internal predecessors, (8607), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 548 states have return successors, (1194), 1062 states have call predecessors, (1194), 1016 states have call successors, (1194) [2022-07-14 00:17:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 10818 transitions. [2022-07-14 00:17:34,778 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 10818 transitions. Word has length 275 [2022-07-14 00:17:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:17:34,778 INFO L495 AbstractCegarLoop]: Abstraction has 7811 states and 10818 transitions. [2022-07-14 00:17:34,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-14 00:17:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 10818 transitions. [2022-07-14 00:17:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-14 00:17:34,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:17:34,784 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:17:34,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 00:17:34,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:17:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:17:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -580629637, now seen corresponding path program 1 times [2022-07-14 00:17:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:17:34,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191220561] [2022-07-14 00:17:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:17:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:17:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:17:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:17:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:17:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:17:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:17:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:17:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:17:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:17:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:17:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:17:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:17:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:17:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:17:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:17:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:17:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:17:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:17:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:17:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:17:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:17:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:17:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 00:17:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:17:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 00:17:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:17:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-14 00:17:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-14 00:17:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:17:36,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191220561] [2022-07-14 00:17:36,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191220561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:17:36,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132567494] [2022-07-14 00:17:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:17:36,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:17:36,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:17:36,763 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-14 00:17:36,764 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-14 00:17:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:17:37,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 186 conjunts are in the unsatisfiable core [2022-07-14 00:17:37,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:17:38,228 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-14 00:17:38,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-07-14 00:17:38,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 00:17:38,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-07-14 00:17:38,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:17:38,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:38,734 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-14 00:17:38,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 37 [2022-07-14 00:17:40,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:40,553 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 00:17:40,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2022-07-14 00:17:41,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:41,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:41,514 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 00:17:41,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 60 [2022-07-14 00:17:41,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:41,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:42,046 INFO L356 Elim1Store]: treesize reduction 94, result has 43.0 percent of original size [2022-07-14 00:17:42,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 54 treesize of output 110 [2022-07-14 00:17:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:42,628 INFO L356 Elim1Store]: treesize reduction 46, result has 51.6 percent of original size [2022-07-14 00:17:42,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 112 [2022-07-14 00:17:44,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:44,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:17:44,561 INFO L356 Elim1Store]: treesize reduction 33, result has 47.6 percent of original size [2022-07-14 00:17:44,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 64 [2022-07-14 00:17:44,581 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:17:44,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-14 00:17:45,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 00:17:45,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 44 [2022-07-14 00:17:46,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 00:17:46,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 00:17:46,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 00:17:58,906 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 00:17:58,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-07-14 00:18:03,086 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 00:18:03,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 00:18:03,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:18:03,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 00:18:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 31 proven. 57 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-14 00:18:03,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:18:33,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-14 00:18:33,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-14 00:18:33,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret387#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-14 00:18:33,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-14 00:18:33,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 120 [2022-07-14 00:18:34,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-07-14 00:18:34,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-07-14 00:18:35,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132567494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:18:35,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:18:35,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 41] total 76 [2022-07-14 00:18:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394036601] [2022-07-14 00:18:35,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:18:35,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-14 00:18:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:18:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-14 00:18:35,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6634, Unknown=32, NotChecked=498, Total=7482 [2022-07-14 00:18:35,174 INFO L87 Difference]: Start difference. First operand 7811 states and 10818 transitions. Second operand has 76 states, 74 states have (on average 4.405405405405405) internal successors, (326), 63 states have internal predecessors, (326), 23 states have call successors, (57), 11 states have call predecessors, (57), 15 states have return successors, (56), 24 states have call predecessors, (56), 23 states have call successors, (56)