./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--can--can-dev.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--can-dev.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 4442f8b76e61cf25cc45d29938cede5ddeca8e04e09b48cb8e4f2b249d1a9c57 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:31:37,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:31:37,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:31:37,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:31:37,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:31:37,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:31:37,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:31:37,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:31:37,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:31:37,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:31:37,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:31:37,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:31:37,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:31:37,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:31:37,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:31:37,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:31:37,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:31:37,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:31:37,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:31:37,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:31:37,465 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:31:37,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:31:37,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:31:37,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:31:37,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:31:37,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:31:37,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:31:37,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:31:37,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:31:37,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:31:37,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:31:37,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:31:37,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:31:37,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:31:37,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:31:37,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:31:37,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:31:37,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:31:37,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:31:37,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:31:37,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:31:37,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:31:37,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:31:37,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:31:37,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:31:37,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:31:37,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:31:37,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:31:37,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:31:37,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:31:37,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:31:37,508 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:31:37,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:31:37,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:31:37,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:31:37,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:31:37,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:31:37,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:31:37,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:31:37,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:31:37,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:31:37,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:31:37,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:31:37,512 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 -> 4442f8b76e61cf25cc45d29938cede5ddeca8e04e09b48cb8e4f2b249d1a9c57 [2022-07-12 12:31:37,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:31:37,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:31:37,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:31:37,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:31:37,748 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:31:37,749 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--can--can-dev.ko-entry_point.cil.out.i [2022-07-12 12:31:37,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afa8a1d6/03e49c85e59941b695e5ff8449d785fc/FLAG36fc24410 [2022-07-12 12:31:38,451 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:31:38,451 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--can--can-dev.ko-entry_point.cil.out.i [2022-07-12 12:31:38,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afa8a1d6/03e49c85e59941b695e5ff8449d785fc/FLAG36fc24410 [2022-07-12 12:31:38,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afa8a1d6/03e49c85e59941b695e5ff8449d785fc [2022-07-12 12:31:38,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:31:38,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:31:38,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:31:38,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:31:38,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:31:38,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:31:38" (1/1) ... [2022-07-12 12:31:38,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e98ffed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:38, skipping insertion in model container [2022-07-12 12:31:38,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:31:38" (1/1) ... [2022-07-12 12:31:38,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:31:38,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:31:39,347 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--can--can-dev.ko-entry_point.cil.out.i[167793,167806] [2022-07-12 12:31:39,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:31:39,724 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:31:39,817 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--can--can-dev.ko-entry_point.cil.out.i[167793,167806] [2022-07-12 12:31:39,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:31:40,012 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:31:40,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40 WrapperNode [2022-07-12 12:31:40,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:31:40,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:31:40,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:31:40,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:31:40,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,190 INFO L137 Inliner]: procedures = 193, calls = 1202, calls flagged for inlining = 77, calls inlined = 49, statements flattened = 2322 [2022-07-12 12:31:40,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:31:40,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:31:40,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:31:40,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:31:40,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:31:40,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:31:40,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:31:40,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:31:40,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (1/1) ... [2022-07-12 12:31:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:31:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:31:40,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:31:40,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:31:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:31:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:31:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:31:40,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:31:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2022-07-12 12:31:40,395 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2022-07-12 12:31:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:31:40,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:31:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:31:40,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:31:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_4 [2022-07-12 12:31:40,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_4 [2022-07-12 12:31:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-12 12:31:40,396 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-12 12:31:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-12 12:31:40,396 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-12 12:31:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:31:40,396 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:31:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure can_newlink [2022-07-12 12:31:40,396 INFO L138 BoogieDeclarations]: Found implementation of procedure can_newlink [2022-07-12 12:31:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:31:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:31:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-12 12:31:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-12 12:31:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb_25 [2022-07-12 12:31:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb_25 [2022-07-12 12:31:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:31:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure can_fill_xstats [2022-07-12 12:31:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fill_xstats [2022-07-12 12:31:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure led_trigger_rename_static [2022-07-12 12:31:40,398 INFO L138 BoogieDeclarations]: Found implementation of procedure led_trigger_rename_static [2022-07-12 12:31:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:31:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:31:40,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:31:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:31:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:31:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure nla_total_size [2022-07-12 12:31:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_total_size [2022-07-12 12:31:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2022-07-12 12:31:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2022-07-12 12:31:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 12:31:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 12:31:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure can_update_spt [2022-07-12 12:31:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure can_update_spt [2022-07-12 12:31:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:31:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:31:40,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:31:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure can_restart [2022-07-12 12:31:40,400 INFO L138 BoogieDeclarations]: Found implementation of procedure can_restart [2022-07-12 12:31:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:31:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-12 12:31:40,401 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-12 12:31:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:31:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure can_skb_reserve [2022-07-12 12:31:40,401 INFO L138 BoogieDeclarations]: Found implementation of procedure can_skb_reserve [2022-07-12 12:31:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:31:40,402 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:31:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:31:40,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-12 12:31:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-12 12:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure can_skb_prv [2022-07-12 12:31:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure can_skb_prv [2022-07-12 12:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:31:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure can_flush_echo_skb [2022-07-12 12:31:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure can_flush_echo_skb [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:31:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-12 12:31:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:31:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put [2022-07-12 12:31:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put [2022-07-12 12:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:31:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure can_get_xstats_size [2022-07-12 12:31:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure can_get_xstats_size [2022-07-12 12:31:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 12:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 12:31:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure can_get_bittiming [2022-07-12 12:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure can_get_bittiming [2022-07-12 12:31:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure can_fill_info [2022-07-12 12:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fill_info [2022-07-12 12:31:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure can_get_size [2022-07-12 12:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure can_get_size [2022-07-12 12:31:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 12:31:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 12:31:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:31:40,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:31:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:31:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure can_changelink [2022-07-12 12:31:40,407 INFO L138 BoogieDeclarations]: Found implementation of procedure can_changelink [2022-07-12 12:31:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:31:40,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:31:40,831 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:31:40,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:31:41,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:31:42,153 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:31:42,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:31:42,162 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:31:42,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:31:42 BoogieIcfgContainer [2022-07-12 12:31:42,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:31:42,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:31:42,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:31:42,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:31:42,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:31:38" (1/3) ... [2022-07-12 12:31:42,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21955fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:31:42, skipping insertion in model container [2022-07-12 12:31:42,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:31:40" (2/3) ... [2022-07-12 12:31:42,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21955fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:31:42, skipping insertion in model container [2022-07-12 12:31:42,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:31:42" (3/3) ... [2022-07-12 12:31:42,180 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--can-dev.ko-entry_point.cil.out.i [2022-07-12 12:31:42,190 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:31:42,191 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:31:42,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:31:42,262 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@3792f312, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2dea637d [2022-07-12 12:31:42,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:31:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 686 states, 516 states have (on average 1.4127906976744187) internal successors, (729), 530 states have internal predecessors, (729), 129 states have call successors, (129), 40 states have call predecessors, (129), 39 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-12 12:31:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 12:31:42,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:42,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:42,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1454109381, now seen corresponding path program 1 times [2022-07-12 12:31:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:42,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725488344] [2022-07-12 12:31:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:31:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:42,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725488344] [2022-07-12 12:31:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725488344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:42,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:42,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:31:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527266732] [2022-07-12 12:31:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:42,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:31:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:31:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:31:42,791 INFO L87 Difference]: Start difference. First operand has 686 states, 516 states have (on average 1.4127906976744187) internal successors, (729), 530 states have internal predecessors, (729), 129 states have call successors, (129), 40 states have call predecessors, (129), 39 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 12:31:45,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:31:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:46,808 INFO L93 Difference]: Finished difference Result 2156 states and 3162 transitions. [2022-07-12 12:31:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:31:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-12 12:31:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:46,828 INFO L225 Difference]: With dead ends: 2156 [2022-07-12 12:31:46,828 INFO L226 Difference]: Without dead ends: 1453 [2022-07-12 12:31:46,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12 12:31:46,838 INFO L413 NwaCegarLoop]: 1028 mSDtfsCounter, 1270 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 367 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:46,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 2154 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 769 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 12:31:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-12 12:31:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1309. [2022-07-12 12:31:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 991 states have (on average 1.3925327951564077) internal successors, (1380), 1005 states have internal predecessors, (1380), 241 states have call successors, (241), 77 states have call predecessors, (241), 76 states have return successors, (240), 234 states have call predecessors, (240), 240 states have call successors, (240) [2022-07-12 12:31:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1861 transitions. [2022-07-12 12:31:46,999 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1861 transitions. Word has length 27 [2022-07-12 12:31:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:46,999 INFO L495 AbstractCegarLoop]: Abstraction has 1309 states and 1861 transitions. [2022-07-12 12:31:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 12:31:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1861 transitions. [2022-07-12 12:31:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 12:31:47,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:47,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:47,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:31:47,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1553363810, now seen corresponding path program 1 times [2022-07-12 12:31:47,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:47,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002799301] [2022-07-12 12:31:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:31:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:47,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002799301] [2022-07-12 12:31:47,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002799301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:47,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:31:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647534455] [2022-07-12 12:31:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:31:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:31:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:31:47,215 INFO L87 Difference]: Start difference. First operand 1309 states and 1861 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 12:31:49,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:31:53,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:31:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:53,639 INFO L93 Difference]: Finished difference Result 4184 states and 6038 transitions. [2022-07-12 12:31:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:31:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-12 12:31:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:53,654 INFO L225 Difference]: With dead ends: 4184 [2022-07-12 12:31:53,654 INFO L226 Difference]: Without dead ends: 2875 [2022-07-12 12:31:53,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-12 12:31:53,661 INFO L413 NwaCegarLoop]: 1102 mSDtfsCounter, 1241 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 356 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:53,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 3858 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1668 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 12:31:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2022-07-12 12:31:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2637. [2022-07-12 12:31:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 1996 states have (on average 1.3922845691382766) internal successors, (2779), 2028 states have internal predecessors, (2779), 480 states have call successors, (480), 153 states have call predecessors, (480), 160 states have return successors, (524), 471 states have call predecessors, (524), 479 states have call successors, (524) [2022-07-12 12:31:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3783 transitions. [2022-07-12 12:31:53,805 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3783 transitions. Word has length 32 [2022-07-12 12:31:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:53,806 INFO L495 AbstractCegarLoop]: Abstraction has 2637 states and 3783 transitions. [2022-07-12 12:31:53,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 12:31:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3783 transitions. [2022-07-12 12:31:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 12:31:53,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:53,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:53,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:31:53,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1997043622, now seen corresponding path program 1 times [2022-07-12 12:31:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:53,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921202302] [2022-07-12 12:31:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:31:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:31:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:31:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:31:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:31:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:31:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:31:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:31:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 12:31:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921202302] [2022-07-12 12:31:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921202302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:54,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:54,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:31:54,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228119293] [2022-07-12 12:31:54,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:31:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:31:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:31:54,232 INFO L87 Difference]: Start difference. First operand 2637 states and 3783 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:31:57,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:31:58,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:01,429 INFO L93 Difference]: Finished difference Result 5825 states and 8536 transitions. [2022-07-12 12:32:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:32:01,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2022-07-12 12:32:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:01,445 INFO L225 Difference]: With dead ends: 5825 [2022-07-12 12:32:01,446 INFO L226 Difference]: Without dead ends: 3195 [2022-07-12 12:32:01,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:32:01,459 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 509 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 334 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:01,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 3157 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2430 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 12:32:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-07-12 12:32:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2651. [2022-07-12 12:32:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2000 states have (on average 1.3875) internal successors, (2775), 2036 states have internal predecessors, (2775), 480 states have call successors, (480), 153 states have call predecessors, (480), 170 states have return successors, (548), 477 states have call predecessors, (548), 479 states have call successors, (548) [2022-07-12 12:32:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3803 transitions. [2022-07-12 12:32:01,626 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3803 transitions. Word has length 134 [2022-07-12 12:32:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:01,626 INFO L495 AbstractCegarLoop]: Abstraction has 2651 states and 3803 transitions. [2022-07-12 12:32:01,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:32:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3803 transitions. [2022-07-12 12:32:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 12:32:01,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:01,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:01,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:32:01,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1661333466, now seen corresponding path program 1 times [2022-07-12 12:32:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:01,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594287879] [2022-07-12 12:32:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:32:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:32:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:32:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 12:32:02,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:02,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594287879] [2022-07-12 12:32:02,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594287879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:02,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:02,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:32:02,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659046440] [2022-07-12 12:32:02,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:32:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:32:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:32:02,114 INFO L87 Difference]: Start difference. First operand 2651 states and 3803 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 12:32:04,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:06,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:08,412 INFO L93 Difference]: Finished difference Result 6153 states and 9023 transitions. [2022-07-12 12:32:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:32:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2022-07-12 12:32:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:08,429 INFO L225 Difference]: With dead ends: 6153 [2022-07-12 12:32:08,430 INFO L226 Difference]: Without dead ends: 3509 [2022-07-12 12:32:08,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:32:08,439 INFO L413 NwaCegarLoop]: 1096 mSDtfsCounter, 2021 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 808 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:08,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 3206 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 2072 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 12:32:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2022-07-12 12:32:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 2657. [2022-07-12 12:32:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2006 states have (on average 1.3858424725822533) internal successors, (2780), 2042 states have internal predecessors, (2780), 480 states have call successors, (480), 153 states have call predecessors, (480), 170 states have return successors, (548), 477 states have call predecessors, (548), 479 states have call successors, (548) [2022-07-12 12:32:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3808 transitions. [2022-07-12 12:32:08,566 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3808 transitions. Word has length 141 [2022-07-12 12:32:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:08,567 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 3808 transitions. [2022-07-12 12:32:08,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 12:32:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3808 transitions. [2022-07-12 12:32:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 12:32:08,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:08,573 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:32:08,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2054360476, now seen corresponding path program 1 times [2022-07-12 12:32:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:08,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836430660] [2022-07-12 12:32:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:32:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:32:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:32:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 12:32:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836430660] [2022-07-12 12:32:10,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836430660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:10,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061511117] [2022-07-12 12:32:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:10,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:10,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:32:10,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:32:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 2310 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 12:32:10,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 12:32:10,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:32:10,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061511117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:10,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:32:10,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [21] total 22 [2022-07-12 12:32:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308655359] [2022-07-12 12:32:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:10,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 12:32:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 12:32:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-07-12 12:32:10,858 INFO L87 Difference]: Start difference. First operand 2657 states and 3808 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 12:32:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:11,477 INFO L93 Difference]: Finished difference Result 5693 states and 8245 transitions. [2022-07-12 12:32:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:32:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 4 states have call successors, (16) Word has length 141 [2022-07-12 12:32:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:11,493 INFO L225 Difference]: With dead ends: 5693 [2022-07-12 12:32:11,493 INFO L226 Difference]: Without dead ends: 3043 [2022-07-12 12:32:11,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-07-12 12:32:11,505 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 109 mSDsluCounter, 16903 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 17979 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:11,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 17979 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:32:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-07-12 12:32:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2679. [2022-07-12 12:32:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2679 states, 2022 states have (on average 1.380811078140455) internal successors, (2792), 2054 states have internal predecessors, (2792), 484 states have call successors, (484), 153 states have call predecessors, (484), 172 states have return successors, (554), 487 states have call predecessors, (554), 483 states have call successors, (554) [2022-07-12 12:32:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 3830 transitions. [2022-07-12 12:32:11,618 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 3830 transitions. Word has length 141 [2022-07-12 12:32:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:11,619 INFO L495 AbstractCegarLoop]: Abstraction has 2679 states and 3830 transitions. [2022-07-12 12:32:11,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 12:32:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 3830 transitions. [2022-07-12 12:32:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 12:32:11,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:11,625 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:11,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 12:32:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:11,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -545184097, now seen corresponding path program 1 times [2022-07-12 12:32:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006774850] [2022-07-12 12:32:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:32:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:32:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:32:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:32:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:32:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:32:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 12:32:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006774850] [2022-07-12 12:32:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006774850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:12,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:12,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:32:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854699608] [2022-07-12 12:32:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:12,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:32:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:32:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:32:12,103 INFO L87 Difference]: Start difference. First operand 2679 states and 3830 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:32:14,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:15,950 INFO L93 Difference]: Finished difference Result 4572 states and 6696 transitions. [2022-07-12 12:32:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:32:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2022-07-12 12:32:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:15,966 INFO L225 Difference]: With dead ends: 4572 [2022-07-12 12:32:15,967 INFO L226 Difference]: Without dead ends: 3213 [2022-07-12 12:32:15,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:32:15,974 INFO L413 NwaCegarLoop]: 900 mSDtfsCounter, 515 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 330 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:15,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2079 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1410 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 12:32:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2022-07-12 12:32:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 2683. [2022-07-12 12:32:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2026 states have (on average 1.3800592300098717) internal successors, (2796), 2058 states have internal predecessors, (2796), 484 states have call successors, (484), 153 states have call predecessors, (484), 172 states have return successors, (554), 487 states have call predecessors, (554), 483 states have call successors, (554) [2022-07-12 12:32:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3834 transitions. [2022-07-12 12:32:16,081 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3834 transitions. Word has length 153 [2022-07-12 12:32:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:16,081 INFO L495 AbstractCegarLoop]: Abstraction has 2683 states and 3834 transitions. [2022-07-12 12:32:16,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:32:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3834 transitions. [2022-07-12 12:32:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 12:32:16,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:16,088 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:32:16,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1431627006, now seen corresponding path program 1 times [2022-07-12 12:32:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:16,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227357890] [2022-07-12 12:32:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:32:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:32:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:32:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:32:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:32:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:32:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 12:32:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:16,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227357890] [2022-07-12 12:32:16,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227357890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:16,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:16,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:32:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632643922] [2022-07-12 12:32:16,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:16,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:32:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:32:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:32:16,445 INFO L87 Difference]: Start difference. First operand 2683 states and 3834 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 8 states have internal predecessors, (103), 5 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-12 12:32:19,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:21,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:22,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:28,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:30,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:32,006 INFO L93 Difference]: Finished difference Result 6461 states and 9401 transitions. [2022-07-12 12:32:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:32:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 8 states have internal predecessors, (103), 5 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2022-07-12 12:32:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:32,021 INFO L225 Difference]: With dead ends: 6461 [2022-07-12 12:32:32,021 INFO L226 Difference]: Without dead ends: 3785 [2022-07-12 12:32:32,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:32:32,029 INFO L413 NwaCegarLoop]: 1020 mSDtfsCounter, 2402 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 989 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 7255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:32,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2565 Valid, 3615 Invalid, 7255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 6262 Invalid, 4 Unknown, 0 Unchecked, 15.2s Time] [2022-07-12 12:32:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2022-07-12 12:32:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3173. [2022-07-12 12:32:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2372 states have (on average 1.3524451939291737) internal successors, (3208), 2408 states have internal predecessors, (3208), 580 states have call successors, (580), 181 states have call predecessors, (580), 220 states have return successors, (716), 599 states have call predecessors, (716), 579 states have call successors, (716) [2022-07-12 12:32:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4504 transitions. [2022-07-12 12:32:32,175 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4504 transitions. Word has length 155 [2022-07-12 12:32:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:32,175 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4504 transitions. [2022-07-12 12:32:32,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 8 states have internal predecessors, (103), 5 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-12 12:32:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4504 transitions. [2022-07-12 12:32:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:32:32,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:32,182 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:32,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:32:32,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1917888894, now seen corresponding path program 1 times [2022-07-12 12:32:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:32,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021888993] [2022-07-12 12:32:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:32:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:32:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:32:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:32:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:32:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:32:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:32:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 12:32:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:32,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021888993] [2022-07-12 12:32:32,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021888993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:32,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:32,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:32:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512878596] [2022-07-12 12:32:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:32,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:32:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:32:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:32:32,654 INFO L87 Difference]: Start difference. First operand 3173 states and 4504 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:32:35,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:37,135 INFO L93 Difference]: Finished difference Result 6891 states and 9971 transitions. [2022-07-12 12:32:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:32:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2022-07-12 12:32:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:37,166 INFO L225 Difference]: With dead ends: 6891 [2022-07-12 12:32:37,167 INFO L226 Difference]: Without dead ends: 3713 [2022-07-12 12:32:37,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:32:37,179 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 412 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 222 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:37,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 2939 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2188 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 12:32:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2022-07-12 12:32:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3179. [2022-07-12 12:32:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 2378 states have (on average 1.3515559293523969) internal successors, (3214), 2414 states have internal predecessors, (3214), 580 states have call successors, (580), 181 states have call predecessors, (580), 220 states have return successors, (716), 599 states have call predecessors, (716), 579 states have call successors, (716) [2022-07-12 12:32:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4510 transitions. [2022-07-12 12:32:37,320 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4510 transitions. Word has length 162 [2022-07-12 12:32:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:37,320 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 4510 transitions. [2022-07-12 12:32:37,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:32:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4510 transitions. [2022-07-12 12:32:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 12:32:37,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:37,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:37,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:32:37,328 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 181373466, now seen corresponding path program 1 times [2022-07-12 12:32:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:37,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380567579] [2022-07-12 12:32:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:32:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:32:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:32:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:32:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:32:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 12:32:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:32:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 12:32:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380567579] [2022-07-12 12:32:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380567579] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391411780] [2022-07-12 12:32:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:37,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:37,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:37,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:32:37,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:32:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:38,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 12:32:38,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 12:32:38,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:32:38,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391411780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:38,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:32:38,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2022-07-12 12:32:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599707272] [2022-07-12 12:32:38,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 12:32:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 12:32:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2022-07-12 12:32:38,949 INFO L87 Difference]: Start difference. First operand 3179 states and 4510 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (20), 9 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 12:32:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:39,739 INFO L93 Difference]: Finished difference Result 6895 states and 9903 transitions. [2022-07-12 12:32:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 12:32:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (20), 9 states have call predecessors, (20), 6 states have call successors, (20) Word has length 163 [2022-07-12 12:32:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:39,754 INFO L225 Difference]: With dead ends: 6895 [2022-07-12 12:32:39,755 INFO L226 Difference]: Without dead ends: 3723 [2022-07-12 12:32:39,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 12:32:39,767 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 437 mSDsluCounter, 16226 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 17194 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:39,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 17194 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 12:32:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-07-12 12:32:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3211. [2022-07-12 12:32:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 2402 states have (on average 1.347210657785179) internal successors, (3236), 2438 states have internal predecessors, (3236), 588 states have call successors, (588), 181 states have call predecessors, (588), 220 states have return successors, (724), 607 states have call predecessors, (724), 587 states have call successors, (724) [2022-07-12 12:32:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4548 transitions. [2022-07-12 12:32:39,929 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4548 transitions. Word has length 163 [2022-07-12 12:32:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:39,929 INFO L495 AbstractCegarLoop]: Abstraction has 3211 states and 4548 transitions. [2022-07-12 12:32:39,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (20), 9 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 12:32:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4548 transitions. [2022-07-12 12:32:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 12:32:39,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:39,936 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:39,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:32:40,160 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,SelfDestructingSolverStorable8 [2022-07-12 12:32:40,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1719713496, now seen corresponding path program 1 times [2022-07-12 12:32:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221245944] [2022-07-12 12:32:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:32:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:32:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:32:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:32:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:32:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 12:32:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:32:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 12:32:40,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:40,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221245944] [2022-07-12 12:32:40,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221245944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:40,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506694098] [2022-07-12 12:32:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:40,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:40,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:32:40,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:32:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:41,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2557 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 12:32:41,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 12:32:41,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:32:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 12:32:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506694098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:32:42,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:32:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 10] total 35 [2022-07-12 12:32:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499573347] [2022-07-12 12:32:42,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:32:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 12:32:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 12:32:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 12:32:42,314 INFO L87 Difference]: Start difference. First operand 3211 states and 4548 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 26 states have internal predecessors, (165), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (39), 12 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-12 12:32:47,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:49,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:32:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:55,480 INFO L93 Difference]: Finished difference Result 7445 states and 10813 transitions. [2022-07-12 12:32:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 12:32:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 26 states have internal predecessors, (165), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (39), 12 states have call predecessors, (39), 8 states have call successors, (39) Word has length 163 [2022-07-12 12:32:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:55,496 INFO L225 Difference]: With dead ends: 7445 [2022-07-12 12:32:55,496 INFO L226 Difference]: Without dead ends: 4229 [2022-07-12 12:32:55,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=289, Invalid=3133, Unknown=0, NotChecked=0, Total=3422 [2022-07-12 12:32:55,508 INFO L413 NwaCegarLoop]: 899 mSDtfsCounter, 1218 mSDsluCounter, 14391 mSDsCounter, 0 mSdLazyCounter, 14078 mSolverCounterSat, 678 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 15290 SdHoareTripleChecker+Invalid, 14758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 14078 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:55,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 15290 Invalid, 14758 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [678 Valid, 14078 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2022-07-12 12:32:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2022-07-12 12:32:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 3233. [2022-07-12 12:32:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 2424 states have (on average 1.3432343234323432) internal successors, (3256), 2460 states have internal predecessors, (3256), 588 states have call successors, (588), 181 states have call predecessors, (588), 220 states have return successors, (724), 607 states have call predecessors, (724), 587 states have call successors, (724) [2022-07-12 12:32:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4568 transitions. [2022-07-12 12:32:55,682 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4568 transitions. Word has length 163 [2022-07-12 12:32:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:55,683 INFO L495 AbstractCegarLoop]: Abstraction has 3233 states and 4568 transitions. [2022-07-12 12:32:55,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 26 states have internal predecessors, (165), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (39), 12 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-12 12:32:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4568 transitions. [2022-07-12 12:32:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 12:32:55,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:55,690 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:55,727 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-12 12:32:55,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:55,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1170888062, now seen corresponding path program 1 times [2022-07-12 12:32:55,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:55,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626526352] [2022-07-12 12:32:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:32:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:32:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:32:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:32:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:32:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:32:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:32:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:32:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 12:32:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:32:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:32:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:32:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:32:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:32:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626526352] [2022-07-12 12:32:56,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626526352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:56,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:56,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:32:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071156106] [2022-07-12 12:32:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:56,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:32:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:32:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:32:56,363 INFO L87 Difference]: Start difference. First operand 3233 states and 4568 transitions. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 9 states have internal predecessors, (120), 6 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-12 12:32:59,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:01,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:03,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:05,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:11,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:13,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:15,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:18,563 INFO L93 Difference]: Finished difference Result 8304 states and 12392 transitions. [2022-07-12 12:33:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 12:33:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 9 states have internal predecessors, (120), 6 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) Word has length 178 [2022-07-12 12:33:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:18,591 INFO L225 Difference]: With dead ends: 8304 [2022-07-12 12:33:18,591 INFO L226 Difference]: Without dead ends: 6403 [2022-07-12 12:33:18,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 12:33:18,604 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 4652 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 8974 mSolverCounterSat, 2665 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4932 SdHoareTripleChecker+Valid, 6542 SdHoareTripleChecker+Invalid, 11645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2665 IncrementalHoareTripleChecker+Valid, 8974 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:18,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 6542 Invalid, 11645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2665 Valid, 8974 Invalid, 6 Unknown, 0 Unchecked, 21.4s Time] [2022-07-12 12:33:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2022-07-12 12:33:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 4095. [2022-07-12 12:33:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 3040 states have (on average 1.3072368421052631) internal successors, (3974), 3106 states have internal predecessors, (3974), 718 states have call successors, (718), 257 states have call predecessors, (718), 336 states have return successors, (952), 747 states have call predecessors, (952), 717 states have call successors, (952) [2022-07-12 12:33:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 5644 transitions. [2022-07-12 12:33:18,897 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 5644 transitions. Word has length 178 [2022-07-12 12:33:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:18,899 INFO L495 AbstractCegarLoop]: Abstraction has 4095 states and 5644 transitions. [2022-07-12 12:33:18,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 9 states have internal predecessors, (120), 6 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-12 12:33:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 5644 transitions. [2022-07-12 12:33:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 12:33:18,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:18,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:33:18,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1720072675, now seen corresponding path program 1 times [2022-07-12 12:33:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580273320] [2022-07-12 12:33:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:33:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:33:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:33:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:33:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:33:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:33:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 12:33:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:33:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:33:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:33:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:33:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:33:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:19,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580273320] [2022-07-12 12:33:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580273320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:33:19,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:33:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:33:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673250129] [2022-07-12 12:33:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:33:19,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:33:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:33:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:33:19,250 INFO L87 Difference]: Start difference. First operand 4095 states and 5644 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:33:22,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:23,661 INFO L93 Difference]: Finished difference Result 7416 states and 10404 transitions. [2022-07-12 12:33:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:33:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 180 [2022-07-12 12:33:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:23,678 INFO L225 Difference]: With dead ends: 7416 [2022-07-12 12:33:23,678 INFO L226 Difference]: Without dead ends: 4651 [2022-07-12 12:33:23,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:33:23,686 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 428 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 232 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:23,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2957 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2177 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 12:33:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2022-07-12 12:33:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4095. [2022-07-12 12:33:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 3040 states have (on average 1.3046052631578948) internal successors, (3966), 3106 states have internal predecessors, (3966), 718 states have call successors, (718), 257 states have call predecessors, (718), 336 states have return successors, (948), 747 states have call predecessors, (948), 717 states have call successors, (948) [2022-07-12 12:33:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 5632 transitions. [2022-07-12 12:33:23,924 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 5632 transitions. Word has length 180 [2022-07-12 12:33:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:23,924 INFO L495 AbstractCegarLoop]: Abstraction has 4095 states and 5632 transitions. [2022-07-12 12:33:23,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:33:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 5632 transitions. [2022-07-12 12:33:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 12:33:23,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:23,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:23,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:33:23,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1585140842, now seen corresponding path program 1 times [2022-07-12 12:33:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:23,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229553341] [2022-07-12 12:33:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:33:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:33:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:33:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:33:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:33:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:33:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 12:33:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:33:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:33:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:33:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:33:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:24,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229553341] [2022-07-12 12:33:24,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229553341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:33:24,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22803409] [2022-07-12 12:33:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:33:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:33:24,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:33:24,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:33:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:25,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 12:33:25,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:33:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 12:33:25,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:33:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:26,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22803409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:33:26,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:33:26,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-12 12:33:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758575188] [2022-07-12 12:33:26,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:33:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 12:33:26,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 12:33:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:33:26,084 INFO L87 Difference]: Start difference. First operand 4095 states and 5632 transitions. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 12:33:28,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:30,823 INFO L93 Difference]: Finished difference Result 8835 states and 12369 transitions. [2022-07-12 12:33:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 12:33:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2022-07-12 12:33:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:30,837 INFO L225 Difference]: With dead ends: 8835 [2022-07-12 12:33:30,838 INFO L226 Difference]: Without dead ends: 4699 [2022-07-12 12:33:30,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-07-12 12:33:30,847 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 825 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:30,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 3268 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 12:33:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2022-07-12 12:33:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4143. [2022-07-12 12:33:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 3088 states have (on average 1.2998704663212435) internal successors, (4014), 3154 states have internal predecessors, (4014), 718 states have call successors, (718), 257 states have call predecessors, (718), 336 states have return successors, (948), 747 states have call predecessors, (948), 717 states have call successors, (948) [2022-07-12 12:33:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5680 transitions. [2022-07-12 12:33:31,101 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5680 transitions. Word has length 182 [2022-07-12 12:33:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:31,102 INFO L495 AbstractCegarLoop]: Abstraction has 4143 states and 5680 transitions. [2022-07-12 12:33:31,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 12:33:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5680 transitions. [2022-07-12 12:33:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 12:33:31,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:31,108 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:31,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:33:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:33:31,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 471626390, now seen corresponding path program 2 times [2022-07-12 12:33:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321051554] [2022-07-12 12:33:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:33:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:33:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:33:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:33:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:33:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:33:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:33:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:33:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:33:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:33:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 12:33:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:31,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321051554] [2022-07-12 12:33:31,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321051554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:33:31,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548915124] [2022-07-12 12:33:31,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:33:31,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:33:31,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:33:32,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:33:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:33:33,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:33:33,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:33:33,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 2750 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 12:33:33,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:33:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 12:33:33,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:33:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:33,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548915124] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:33:33,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:33:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2022-07-12 12:33:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548738004] [2022-07-12 12:33:33,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:33:33,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 12:33:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 12:33:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2022-07-12 12:33:33,897 INFO L87 Difference]: Start difference. First operand 4143 states and 5680 transitions. Second operand has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 12:33:37,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-12 12:33:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:45,992 INFO L93 Difference]: Finished difference Result 8979 states and 12561 transitions. [2022-07-12 12:33:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 12:33:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2022-07-12 12:33:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:46,008 INFO L225 Difference]: With dead ends: 8979 [2022-07-12 12:33:46,008 INFO L226 Difference]: Without dead ends: 4795 [2022-07-12 12:33:46,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=408, Invalid=1074, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 12:33:46,018 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 861 mSDsluCounter, 4457 mSDsCounter, 0 mSdLazyCounter, 4468 mSolverCounterSat, 591 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 5060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 4468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:46,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 5324 Invalid, 5060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 4468 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 12:33:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2022-07-12 12:33:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4239. [2022-07-12 12:33:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 3184 states have (on average 1.2908291457286432) internal successors, (4110), 3250 states have internal predecessors, (4110), 718 states have call successors, (718), 257 states have call predecessors, (718), 336 states have return successors, (948), 747 states have call predecessors, (948), 717 states have call successors, (948) [2022-07-12 12:33:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 5776 transitions. [2022-07-12 12:33:46,299 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 5776 transitions. Word has length 186 [2022-07-12 12:33:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:46,300 INFO L495 AbstractCegarLoop]: Abstraction has 4239 states and 5776 transitions. [2022-07-12 12:33:46,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (40), 6 states have call predecessors, (40), 5 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 12:33:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 5776 transitions. [2022-07-12 12:33:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 12:33:46,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:46,306 INFO L195 NwaCegarLoop]: trace histogram [14, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:46,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:33:46,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 12:33:46,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1923514218, now seen corresponding path program 3 times [2022-07-12 12:33:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:46,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124585039] [2022-07-12 12:33:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:33:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 12:33:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:33:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:33:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:33:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:33:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:33:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:33:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:33:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:33:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:33:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:33:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 4 proven. 105 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:47,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:47,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124585039] [2022-07-12 12:33:47,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124585039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:33:47,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883287777] [2022-07-12 12:33:47,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 12:33:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:33:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:33:47,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:33:47,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process