./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.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 2ecffe8a5f60817da30887d6b361935e398ff8703e4fd5b17747e558625c4088 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 03:52:26,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:52:26,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:52:26,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:52:26,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:52:26,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:52:26,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:52:26,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:52:26,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:52:26,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:52:26,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:52:26,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:52:26,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:52:26,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:52:26,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:52:26,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:52:26,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:52:26,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:52:26,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:52:26,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:52:26,547 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:52:26,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:52:26,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:52:26,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:52:26,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:52:26,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:52:26,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:52:26,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:52:26,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:52:26,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:52:26,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:52:26,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:52:26,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:52:26,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:52:26,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:52:26,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:52:26,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:52:26,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:52:26,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:52:26,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:52:26,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:52:26,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:52:26,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 03:52:26,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:52:26,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:52:26,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:52:26,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:52:26,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:52:26,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:52:26,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:52:26,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:52:26,606 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:52:26,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:52:26,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:52:26,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:52:26,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:52:26,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:52:26,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:52:26,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:52:26,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:52:26,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:52:26,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:52:26,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:52:26,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 03:52:26,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 03:52:26,611 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:52:26,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:52:26,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:52:26,612 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 -> 2ecffe8a5f60817da30887d6b361935e398ff8703e4fd5b17747e558625c4088 [2022-07-20 03:52:26,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:52:26,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:52:26,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:52:26,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:52:26,847 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:52:26,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i [2022-07-20 03:52:26,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a02f68b6/edbe399e0b7e4a1ca9281ec22fb068d4/FLAGae5155d39 [2022-07-20 03:52:27,721 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:52:27,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i [2022-07-20 03:52:27,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a02f68b6/edbe399e0b7e4a1ca9281ec22fb068d4/FLAGae5155d39 [2022-07-20 03:52:27,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a02f68b6/edbe399e0b7e4a1ca9281ec22fb068d4 [2022-07-20 03:52:27,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:52:27,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:52:27,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:52:27,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:52:27,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:52:27,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:52:27" (1/1) ... [2022-07-20 03:52:27,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee09bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:27, skipping insertion in model container [2022-07-20 03:52:27,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:52:27" (1/1) ... [2022-07-20 03:52:27,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:52:27,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:52:30,018 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-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i[331724,331737] [2022-07-20 03:52:30,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:52:30,175 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 03:52:30,615 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-challenges/linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i[331724,331737] [2022-07-20 03:52:30,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:52:30,704 INFO L208 MainTranslator]: Completed translation [2022-07-20 03:52:30,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30 WrapperNode [2022-07-20 03:52:30,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 03:52:30,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 03:52:30,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 03:52:30,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 03:52:30,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:30,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,103 INFO L137 Inliner]: procedures = 273, calls = 4073, calls flagged for inlining = 105, calls inlined = 96, statements flattened = 9059 [2022-07-20 03:52:31,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 03:52:31,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 03:52:31,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 03:52:31,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 03:52:31,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 03:52:31,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 03:52:31,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 03:52:31,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 03:52:31,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (1/1) ... [2022-07-20 03:52:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:52:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:52:31,549 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-20 03:52:31,571 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-20 03:52:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-20 03:52:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-20 03:52:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure osst_log_options [2022-07-20 03:52:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_log_options [2022-07-20 03:52:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2022-07-20 03:52:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2022-07-20 03:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-20 03:52:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-20 03:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-20 03:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 03:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 03:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_behind_check [2022-07-20 03:52:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_behind_check [2022-07-20 03:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-20 03:52:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-20 03:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_block_when_processing_errors [2022-07-20 03:52:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_block_when_processing_errors [2022-07-20 03:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 03:52:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 03:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_unlock [2022-07-20 03:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_unlock [2022-07-20 03:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure osst_release_request [2022-07-20 03:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_release_request [2022-07-20 03:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 03:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 03:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure osst_set_frame_position [2022-07-20 03:52:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_set_frame_position [2022-07-20 03:52:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_header [2022-07-20 03:52:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_header [2022-07-20 03:52:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_osst_tape [2022-07-20 03:52:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_osst_tape [2022-07-20 03:52:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock_of_osst_tape [2022-07-20 03:52:31,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock_of_osst_tape [2022-07-20 03:52:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-20 03:52:31,595 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-20 03:52:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 03:52:31,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 03:52:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-20 03:52:31,595 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-20 03:52:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure osst_read_frame [2022-07-20 03:52:31,596 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_read_frame [2022-07-20 03:52:31,596 INFO L130 BoogieDeclarations]: Found specification of procedure tape_name [2022-07-20 03:52:31,596 INFO L138 BoogieDeclarations]: Found implementation of procedure tape_name [2022-07-20 03:52:31,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-20 03:52:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-20 03:52:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_device_put [2022-07-20 03:52:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_device_put [2022-07-20 03:52:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 03:52:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 03:52:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure osst_flush_write_buffer [2022-07-20 03:52:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_flush_write_buffer [2022-07-20 03:52:31,598 INFO L130 BoogieDeclarations]: Found specification of procedure osst_initiate_read [2022-07-20 03:52:31,598 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_initiate_read [2022-07-20 03:52:31,598 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-20 03:52:31,598 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-20 03:52:31,598 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_ioctl [2022-07-20 03:52:31,599 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_ioctl [2022-07-20 03:52:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure osst_seek_logical_blk [2022-07-20 03:52:31,600 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_seek_logical_blk [2022-07-20 03:52:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_osst_int_mutex [2022-07-20 03:52:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_osst_int_mutex [2022-07-20 03:52:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_trailer [2022-07-20 03:52:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_trailer [2022-07-20 03:52:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure osst_flush_drive_buffer [2022-07-20 03:52:31,601 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_flush_drive_buffer [2022-07-20 03:52:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 03:52:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_osst_int_mutex [2022-07-20 03:52:31,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_osst_int_mutex [2022-07-20 03:52:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 03:52:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure osst_int_ioctl [2022-07-20 03:52:31,602 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_int_ioctl [2022-07-20 03:52:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_pages [2022-07-20 03:52:31,603 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_pages [2022-07-20 03:52:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure do_door_lock [2022-07-20 03:52:31,603 INFO L138 BoogieDeclarations]: Found implementation of procedure do_door_lock [2022-07-20 03:52:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 03:52:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure osst_copy_to_buffer [2022-07-20 03:52:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_copy_to_buffer [2022-07-20 03:52:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure __osst_analyze_headers [2022-07-20 03:52:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __osst_analyze_headers [2022-07-20 03:52:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-20 03:52:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-20 03:52:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure osst_get_logical_frame [2022-07-20 03:52:31,605 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_get_logical_frame [2022-07-20 03:52:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-07-20 03:52:31,605 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-07-20 03:52:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2022-07-20 03:52:31,605 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2022-07-20 03:52:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 03:52:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure osst_position_tape_and_confirm [2022-07-20 03:52:31,606 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_position_tape_and_confirm [2022-07-20 03:52:31,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 03:52:31,606 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 03:52:31,606 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 03:52:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 03:52:31,607 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 03:52:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 03:52:31,608 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 03:52:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure osst_verify_frame [2022-07-20 03:52:31,608 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_verify_frame [2022-07-20 03:52:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-20 03:52:31,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-20 03:52:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure osst_wait_ready [2022-07-20 03:52:31,609 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_wait_ready [2022-07-20 03:52:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure osst_reset_header [2022-07-20 03:52:31,609 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_reset_header [2022-07-20 03:52:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-20 03:52:31,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-20 03:52:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 03:52:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-20 03:52:31,610 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-20 03:52:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure osst_do_scsi [2022-07-20 03:52:31,611 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_do_scsi [2022-07-20 03:52:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2022-07-20 03:52:31,611 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2022-07-20 03:52:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 03:52:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2022-07-20 03:52:31,612 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2022-07-20 03:52:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 03:52:31,614 INFO L130 BoogieDeclarations]: Found specification of procedure osst_chk_result [2022-07-20 03:52:31,614 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_chk_result [2022-07-20 03:52:31,614 INFO L130 BoogieDeclarations]: Found specification of procedure osst_sysfs_add [2022-07-20 03:52:31,615 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_sysfs_add [2022-07-20 03:52:31,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 03:52:31,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 03:52:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure osst_space_over_filemarks_backward [2022-07-20 03:52:31,617 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_space_over_filemarks_backward [2022-07-20 03:52:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure osst_read_back_buffer_and_rewrite [2022-07-20 03:52:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_read_back_buffer_and_rewrite [2022-07-20 03:52:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure cross_eof [2022-07-20 03:52:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure cross_eof [2022-07-20 03:52:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure osst_sysfs_cleanup [2022-07-20 03:52:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_sysfs_cleanup [2022-07-20 03:52:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 03:52:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 03:52:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_buffer [2022-07-20 03:52:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_buffer [2022-07-20 03:52:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-20 03:52:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-20 03:52:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 03:52:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-20 03:52:31,623 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-20 03:52:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure osst_reposition_and_retry [2022-07-20 03:52:31,623 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_reposition_and_retry [2022-07-20 03:52:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_filemark [2022-07-20 03:52:31,623 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_filemark [2022-07-20 03:52:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure osst_sysfs_destroy [2022-07-20 03:52:31,624 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_sysfs_destroy [2022-07-20 03:52:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 03:52:31,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 03:52:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-20 03:52:31,624 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-20 03:52:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 03:52:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure vmalloc [2022-07-20 03:52:31,624 INFO L138 BoogieDeclarations]: Found implementation of procedure vmalloc [2022-07-20 03:52:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_lock [2022-07-20 03:52:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_lock [2022-07-20 03:52:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-20 03:52:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-20 03:52:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 03:52:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure __osst_write_header [2022-07-20 03:52:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __osst_write_header [2022-07-20 03:52:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_frame [2022-07-20 03:52:31,626 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_frame [2022-07-20 03:52:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-07-20 03:52:31,626 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-07-20 03:52:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 03:52:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 03:52:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure osst_get_frame_position [2022-07-20 03:52:31,626 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_get_frame_position [2022-07-20 03:52:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure osst_flush_buffer [2022-07-20 03:52:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_flush_buffer [2022-07-20 03:52:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure osst_copy_from_buffer [2022-07-20 03:52:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_copy_from_buffer [2022-07-20 03:52:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-20 03:52:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-20 03:52:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-20 03:52:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-20 03:52:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure normalize_buffer [2022-07-20 03:52:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure normalize_buffer [2022-07-20 03:52:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure osst_init_aux [2022-07-20 03:52:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_init_aux [2022-07-20 03:52:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_error_recovery [2022-07-20 03:52:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_error_recovery [2022-07-20 03:52:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure osst_write_eod [2022-07-20 03:52:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_write_eod [2022-07-20 03:52:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-20 03:52:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-20 03:52:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure osst_space_over_filemarks_forward_slow [2022-07-20 03:52:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_space_over_filemarks_forward_slow [2022-07-20 03:52:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-20 03:52:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-20 03:52:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_page [2022-07-20 03:52:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_page [2022-07-20 03:52:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 03:52:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure osst_recover_wait_frame [2022-07-20 03:52:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_recover_wait_frame [2022-07-20 03:52:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure osst_wait_frame [2022-07-20 03:52:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure osst_wait_frame [2022-07-20 03:52:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 03:52:31,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 03:52:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 03:52:31,632 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 03:52:32,794 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 03:52:32,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 03:52:44,662 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 03:52:44,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 03:52:44,694 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 03:52:44,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:52:44 BoogieIcfgContainer [2022-07-20 03:52:44,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 03:52:44,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 03:52:44,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 03:52:44,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 03:52:44,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:52:27" (1/3) ... [2022-07-20 03:52:44,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4e87ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:52:44, skipping insertion in model container [2022-07-20 03:52:44,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:52:30" (2/3) ... [2022-07-20 03:52:44,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4e87ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:52:44, skipping insertion in model container [2022-07-20 03:52:44,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:52:44" (3/3) ... [2022-07-20 03:52:44,708 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--scsi--osst.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.i [2022-07-20 03:52:44,719 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 03:52:44,720 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 03:52:44,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 03:52:44,805 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@3b3e868d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ad71da1 [2022-07-20 03:52:44,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 03:52:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 3078 states, 2381 states have (on average 1.4708105837883243) internal successors, (3502), 2407 states have internal predecessors, (3502), 603 states have call successors, (603), 92 states have call predecessors, (603), 92 states have return successors, (603), 600 states have call predecessors, (603), 603 states have call successors, (603) [2022-07-20 03:52:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 03:52:44,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:52:44,824 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, 1, 1, 1, 1, 1, 1] [2022-07-20 03:52:44,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:52:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:52:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -767786273, now seen corresponding path program 1 times [2022-07-20 03:52:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:52:44,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146458550] [2022-07-20 03:52:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:52:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:52:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:52:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:52:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:52:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:52:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:45,366 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-20 03:52:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:52:45,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146458550] [2022-07-20 03:52:45,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146458550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:52:45,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:52:45,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:52:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458196565] [2022-07-20 03:52:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:52:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:52:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:52:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:52:45,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:52:45,417 INFO L87 Difference]: Start difference. First operand has 3078 states, 2381 states have (on average 1.4708105837883243) internal successors, (3502), 2407 states have internal predecessors, (3502), 603 states have call successors, (603), 92 states have call predecessors, (603), 92 states have return successors, (603), 600 states have call predecessors, (603), 603 states have call successors, (603) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:52:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:52:48,796 INFO L93 Difference]: Finished difference Result 6337 states and 10000 transitions. [2022-07-20 03:52:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 03:52:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-20 03:52:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:52:48,856 INFO L225 Difference]: With dead ends: 6337 [2022-07-20 03:52:48,856 INFO L226 Difference]: Without dead ends: 3256 [2022-07-20 03:52:48,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-20 03:52:48,897 INFO L413 NwaCegarLoop]: 4567 mSDtfsCounter, 5099 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5470 SdHoareTripleChecker+Valid, 7485 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:52:48,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5470 Valid, 7485 Invalid, 1716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1014 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-20 03:52:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2022-07-20 03:52:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3067. [2022-07-20 03:52:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2372 states have (on average 1.4582630691399663) internal successors, (3459), 2396 states have internal predecessors, (3459), 603 states have call successors, (603), 92 states have call predecessors, (603), 91 states have return successors, (595), 592 states have call predecessors, (595), 595 states have call successors, (595) [2022-07-20 03:52:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4657 transitions. [2022-07-20 03:52:49,132 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4657 transitions. Word has length 38 [2022-07-20 03:52:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:52:49,132 INFO L495 AbstractCegarLoop]: Abstraction has 3067 states and 4657 transitions. [2022-07-20 03:52:49,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:52:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4657 transitions. [2022-07-20 03:52:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 03:52:49,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:52:49,135 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, 1, 1, 1, 1, 1, 1] [2022-07-20 03:52:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 03:52:49,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:52:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:52:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash -66186399, now seen corresponding path program 1 times [2022-07-20 03:52:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:52:49,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954736127] [2022-07-20 03:52:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:52:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:52:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:52:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:52:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:52:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:52:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:49,333 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-20 03:52:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:52:49,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954736127] [2022-07-20 03:52:49,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954736127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:52:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:52:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:52:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712395340] [2022-07-20 03:52:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:52:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:52:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:52:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:52:49,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:52:49,340 INFO L87 Difference]: Start difference. First operand 3067 states and 4657 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:52:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:52:52,630 INFO L93 Difference]: Finished difference Result 6316 states and 9662 transitions. [2022-07-20 03:52:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 03:52:52,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-20 03:52:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:52:52,661 INFO L225 Difference]: With dead ends: 6316 [2022-07-20 03:52:52,661 INFO L226 Difference]: Without dead ends: 3256 [2022-07-20 03:52:52,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-20 03:52:52,682 INFO L413 NwaCegarLoop]: 4548 mSDtfsCounter, 5073 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5448 SdHoareTripleChecker+Valid, 7457 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:52:52,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5448 Valid, 7457 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 03:52:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2022-07-20 03:52:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3067. [2022-07-20 03:52:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2372 states have (on average 1.457841483979764) internal successors, (3458), 2396 states have internal predecessors, (3458), 603 states have call successors, (603), 92 states have call predecessors, (603), 91 states have return successors, (595), 592 states have call predecessors, (595), 595 states have call successors, (595) [2022-07-20 03:52:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4656 transitions. [2022-07-20 03:52:52,826 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4656 transitions. Word has length 38 [2022-07-20 03:52:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:52:52,827 INFO L495 AbstractCegarLoop]: Abstraction has 3067 states and 4656 transitions. [2022-07-20 03:52:52,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:52:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4656 transitions. [2022-07-20 03:52:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 03:52:52,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:52:52,830 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, 1, 1, 1, 1, 1, 1] [2022-07-20 03:52:52,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 03:52:52,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:52:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:52:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash -43554145, now seen corresponding path program 1 times [2022-07-20 03:52:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:52:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437634516] [2022-07-20 03:52:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:52:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:52:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:52:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:52:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:52:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:52:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:52:53,041 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-20 03:52:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:52:53,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437634516] [2022-07-20 03:52:53,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437634516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:52:53,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:52:53,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:52:53,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337167498] [2022-07-20 03:52:53,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:52:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:52:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:52:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:52:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:52:53,045 INFO L87 Difference]: Start difference. First operand 3067 states and 4656 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:52:56,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:53:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:01,460 INFO L93 Difference]: Finished difference Result 9477 states and 14530 transitions. [2022-07-20 03:53:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 03:53:01,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-20 03:53:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:01,518 INFO L225 Difference]: With dead ends: 9477 [2022-07-20 03:53:01,518 INFO L226 Difference]: Without dead ends: 6418 [2022-07-20 03:53:01,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-20 03:53:01,546 INFO L413 NwaCegarLoop]: 5061 mSDtfsCounter, 5693 mSDsluCounter, 6792 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 1608 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6156 SdHoareTripleChecker+Valid, 11853 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:01,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6156 Valid, 11853 Invalid, 3725 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1608 Valid, 2116 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-07-20 03:53:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2022-07-20 03:53:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 6023. [2022-07-20 03:53:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6023 states, 4668 states have (on average 1.459083119108826) internal successors, (6811), 4705 states have internal predecessors, (6811), 1174 states have call successors, (1174), 181 states have call predecessors, (1174), 180 states have return successors, (1166), 1160 states have call predecessors, (1166), 1166 states have call successors, (1166) [2022-07-20 03:53:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 9151 transitions. [2022-07-20 03:53:01,860 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 9151 transitions. Word has length 38 [2022-07-20 03:53:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:01,860 INFO L495 AbstractCegarLoop]: Abstraction has 6023 states and 9151 transitions. [2022-07-20 03:53:01,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 03:53:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 9151 transitions. [2022-07-20 03:53:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 03:53:01,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:01,865 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, 1, 1, 1, 1, 1, 1] [2022-07-20 03:53:01,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 03:53:01,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1342649249, now seen corresponding path program 1 times [2022-07-20 03:53:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:01,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750193008] [2022-07-20 03:53:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:02,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:02,078 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-20 03:53:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:02,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750193008] [2022-07-20 03:53:02,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750193008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:02,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:02,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 03:53:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908991216] [2022-07-20 03:53:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:02,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:53:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:53:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 03:53:02,082 INFO L87 Difference]: Start difference. First operand 6023 states and 9151 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 03:53:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:09,864 INFO L93 Difference]: Finished difference Result 19256 states and 30210 transitions. [2022-07-20 03:53:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:53:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2022-07-20 03:53:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:09,966 INFO L225 Difference]: With dead ends: 19256 [2022-07-20 03:53:09,966 INFO L226 Difference]: Without dead ends: 13273 [2022-07-20 03:53:10,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:53:10,017 INFO L413 NwaCegarLoop]: 7235 mSDtfsCounter, 5094 mSDsluCounter, 14285 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 1433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5687 SdHoareTripleChecker+Valid, 21520 SdHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1433 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:10,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5687 Valid, 21520 Invalid, 4838 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1433 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-20 03:53:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13273 states. [2022-07-20 03:53:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13273 to 6025. [2022-07-20 03:53:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 4670 states have (on average 1.4588865096359742) internal successors, (6813), 4707 states have internal predecessors, (6813), 1174 states have call successors, (1174), 181 states have call predecessors, (1174), 180 states have return successors, (1166), 1160 states have call predecessors, (1166), 1166 states have call successors, (1166) [2022-07-20 03:53:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 9153 transitions. [2022-07-20 03:53:10,420 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 9153 transitions. Word has length 38 [2022-07-20 03:53:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:10,421 INFO L495 AbstractCegarLoop]: Abstraction has 6025 states and 9153 transitions. [2022-07-20 03:53:10,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 03:53:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 9153 transitions. [2022-07-20 03:53:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 03:53:10,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:10,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:53:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 03:53:10,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2014242960, now seen corresponding path program 1 times [2022-07-20 03:53:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386558744] [2022-07-20 03:53:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:10,616 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-20 03:53:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386558744] [2022-07-20 03:53:10,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386558744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:10,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:10,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:53:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327337523] [2022-07-20 03:53:10,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:10,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:53:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:53:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:53:10,619 INFO L87 Difference]: Start difference. First operand 6025 states and 9153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:13,159 INFO L93 Difference]: Finished difference Result 6405 states and 9867 transitions. [2022-07-20 03:53:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 03:53:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2022-07-20 03:53:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:13,196 INFO L225 Difference]: With dead ends: 6405 [2022-07-20 03:53:13,197 INFO L226 Difference]: Without dead ends: 6402 [2022-07-20 03:53:13,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-20 03:53:13,205 INFO L413 NwaCegarLoop]: 4549 mSDtfsCounter, 5055 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5423 SdHoareTripleChecker+Valid, 7460 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:13,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5423 Valid, 7460 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 03:53:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2022-07-20 03:53:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6024. [2022-07-20 03:53:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 4670 states have (on average 1.4586723768736616) internal successors, (6812), 4706 states have internal predecessors, (6812), 1173 states have call successors, (1173), 181 states have call predecessors, (1173), 180 states have return successors, (1166), 1160 states have call predecessors, (1166), 1166 states have call successors, (1166) [2022-07-20 03:53:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 9151 transitions. [2022-07-20 03:53:13,473 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 9151 transitions. Word has length 43 [2022-07-20 03:53:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:13,475 INFO L495 AbstractCegarLoop]: Abstraction has 6024 states and 9151 transitions. [2022-07-20 03:53:13,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 9151 transitions. [2022-07-20 03:53:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 03:53:13,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:13,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:53:13,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 03:53:13,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1981866054, now seen corresponding path program 1 times [2022-07-20 03:53:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:13,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900236816] [2022-07-20 03:53:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:13,659 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-20 03:53:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900236816] [2022-07-20 03:53:13,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900236816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:13,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:13,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:53:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023840029] [2022-07-20 03:53:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:53:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:53:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:53:13,662 INFO L87 Difference]: Start difference. First operand 6024 states and 9151 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:18,338 INFO L93 Difference]: Finished difference Result 18692 states and 28709 transitions. [2022-07-20 03:53:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 03:53:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-07-20 03:53:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:18,436 INFO L225 Difference]: With dead ends: 18692 [2022-07-20 03:53:18,436 INFO L226 Difference]: Without dead ends: 12712 [2022-07-20 03:53:18,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-20 03:53:18,473 INFO L413 NwaCegarLoop]: 6917 mSDtfsCounter, 5566 mSDsluCounter, 8220 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 1394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6025 SdHoareTripleChecker+Valid, 15137 SdHoareTripleChecker+Invalid, 3545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1394 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:18,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6025 Valid, 15137 Invalid, 3545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1394 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 03:53:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12712 states. [2022-07-20 03:53:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12712 to 11937. [2022-07-20 03:53:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11937 states, 9271 states have (on average 1.460468126415705) internal successors, (13540), 9342 states have internal predecessors, (13540), 2309 states have call successors, (2309), 358 states have call predecessors, (2309), 356 states have return successors, (2310), 2282 states have call predecessors, (2310), 2298 states have call successors, (2310) [2022-07-20 03:53:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11937 states to 11937 states and 18159 transitions. [2022-07-20 03:53:19,001 INFO L78 Accepts]: Start accepts. Automaton has 11937 states and 18159 transitions. Word has length 44 [2022-07-20 03:53:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:19,002 INFO L495 AbstractCegarLoop]: Abstraction has 11937 states and 18159 transitions. [2022-07-20 03:53:19,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11937 states and 18159 transitions. [2022-07-20 03:53:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 03:53:19,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:53:19,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 03:53:19,005 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1307198771, now seen corresponding path program 1 times [2022-07-20 03:53:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007001054] [2022-07-20 03:53:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:19,299 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-20 03:53:19,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:19,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007001054] [2022-07-20 03:53:19,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007001054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:19,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:19,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:53:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940834717] [2022-07-20 03:53:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:19,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:53:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:19,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:53:19,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:53:19,303 INFO L87 Difference]: Start difference. First operand 11937 states and 18159 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:21,842 INFO L93 Difference]: Finished difference Result 12695 states and 19585 transitions. [2022-07-20 03:53:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 03:53:21,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-07-20 03:53:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:21,921 INFO L225 Difference]: With dead ends: 12695 [2022-07-20 03:53:21,922 INFO L226 Difference]: Without dead ends: 12692 [2022-07-20 03:53:21,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-20 03:53:21,939 INFO L413 NwaCegarLoop]: 4541 mSDtfsCounter, 5051 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5425 SdHoareTripleChecker+Valid, 7445 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:21,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5425 Valid, 7445 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 03:53:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12692 states. [2022-07-20 03:53:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12692 to 11936. [2022-07-20 03:53:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11936 states, 9271 states have (on average 1.4603602631862798) internal successors, (13539), 9341 states have internal predecessors, (13539), 2308 states have call successors, (2308), 358 states have call predecessors, (2308), 356 states have return successors, (2310), 2282 states have call predecessors, (2310), 2298 states have call successors, (2310) [2022-07-20 03:53:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11936 states to 11936 states and 18157 transitions. [2022-07-20 03:53:22,436 INFO L78 Accepts]: Start accepts. Automaton has 11936 states and 18157 transitions. Word has length 45 [2022-07-20 03:53:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:22,436 INFO L495 AbstractCegarLoop]: Abstraction has 11936 states and 18157 transitions. [2022-07-20 03:53:22,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11936 states and 18157 transitions. [2022-07-20 03:53:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 03:53:22,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:22,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:53:22,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 03:53:22,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1867354345, now seen corresponding path program 1 times [2022-07-20 03:53:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:22,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716736631] [2022-07-20 03:53:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:22,665 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-20 03:53:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:22,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716736631] [2022-07-20 03:53:22,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716736631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:22,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:22,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:53:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967605302] [2022-07-20 03:53:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:22,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:53:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:53:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:53:22,667 INFO L87 Difference]: Start difference. First operand 11936 states and 18157 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:26,997 INFO L93 Difference]: Finished difference Result 18312 states and 27746 transitions. [2022-07-20 03:53:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 03:53:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-07-20 03:53:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:27,141 INFO L225 Difference]: With dead ends: 18312 [2022-07-20 03:53:27,142 INFO L226 Difference]: Without dead ends: 18242 [2022-07-20 03:53:27,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-20 03:53:27,172 INFO L413 NwaCegarLoop]: 4736 mSDtfsCounter, 3920 mSDsluCounter, 5871 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 10607 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1276 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:27,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4224 Valid, 10607 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1276 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-20 03:53:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18242 states. [2022-07-20 03:53:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18242 to 16860. [2022-07-20 03:53:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16860 states, 12928 states have (on average 1.437654702970297) internal successors, (18586), 13020 states have internal predecessors, (18586), 3310 states have call successors, (3310), 623 states have call predecessors, (3310), 621 states have return successors, (3314), 3283 states have call predecessors, (3314), 3302 states have call successors, (3314) [2022-07-20 03:53:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16860 states to 16860 states and 25210 transitions. [2022-07-20 03:53:27,989 INFO L78 Accepts]: Start accepts. Automaton has 16860 states and 25210 transitions. Word has length 46 [2022-07-20 03:53:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:27,990 INFO L495 AbstractCegarLoop]: Abstraction has 16860 states and 25210 transitions. [2022-07-20 03:53:27,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 03:53:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16860 states and 25210 transitions. [2022-07-20 03:53:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-20 03:53:27,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:27,994 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:53:27,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 03:53:27,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -545678483, now seen corresponding path program 1 times [2022-07-20 03:53:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:27,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119648281] [2022-07-20 03:53:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 03:53:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-20 03:53:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:53:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:53:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 03:53:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 03:53:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:28,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119648281] [2022-07-20 03:53:28,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119648281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:28,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:28,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 03:53:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570752763] [2022-07-20 03:53:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:28,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:53:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:53:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 03:53:28,186 INFO L87 Difference]: Start difference. First operand 16860 states and 25210 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 03:53:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:35,915 INFO L93 Difference]: Finished difference Result 37195 states and 56325 transitions. [2022-07-20 03:53:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:53:35,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2022-07-20 03:53:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:36,051 INFO L225 Difference]: With dead ends: 37195 [2022-07-20 03:53:36,051 INFO L226 Difference]: Without dead ends: 20390 [2022-07-20 03:53:36,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:53:36,148 INFO L413 NwaCegarLoop]: 4369 mSDtfsCounter, 3940 mSDsluCounter, 4155 mSDsCounter, 0 mSdLazyCounter, 5889 mSolverCounterSat, 1742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 8524 SdHoareTripleChecker+Invalid, 7631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1742 IncrementalHoareTripleChecker+Valid, 5889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:36,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 8524 Invalid, 7631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1742 Valid, 5889 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-20 03:53:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20390 states. [2022-07-20 03:53:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20390 to 18332. [2022-07-20 03:53:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18332 states, 14142 states have (on average 1.4446330080610945) internal successors, (20430), 14246 states have internal predecessors, (20430), 3568 states have call successors, (3568), 623 states have call predecessors, (3568), 621 states have return successors, (3576), 3537 states have call predecessors, (3576), 3560 states have call successors, (3576) [2022-07-20 03:53:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18332 states to 18332 states and 27574 transitions. [2022-07-20 03:53:37,225 INFO L78 Accepts]: Start accepts. Automaton has 18332 states and 27574 transitions. Word has length 85 [2022-07-20 03:53:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:37,226 INFO L495 AbstractCegarLoop]: Abstraction has 18332 states and 27574 transitions. [2022-07-20 03:53:37,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 03:53:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18332 states and 27574 transitions. [2022-07-20 03:53:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 03:53:37,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:37,231 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 03:53:37,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 03:53:37,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1631405334, now seen corresponding path program 1 times [2022-07-20 03:53:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:37,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116054012] [2022-07-20 03:53:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 03:53:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 03:53:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:53:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:53:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:53:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:53:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-20 03:53:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 03:53:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:37,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116054012] [2022-07-20 03:53:37,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116054012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:37,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:37,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 03:53:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158137574] [2022-07-20 03:53:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:53:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:53:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 03:53:37,461 INFO L87 Difference]: Start difference. First operand 18332 states and 27574 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:53:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:53:47,165 INFO L93 Difference]: Finished difference Result 19716 states and 30043 transitions. [2022-07-20 03:53:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 03:53:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2022-07-20 03:53:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:53:47,287 INFO L225 Difference]: With dead ends: 19716 [2022-07-20 03:53:47,287 INFO L226 Difference]: Without dead ends: 19713 [2022-07-20 03:53:47,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:53:47,313 INFO L413 NwaCegarLoop]: 5604 mSDtfsCounter, 5947 mSDsluCounter, 3636 mSDsCounter, 0 mSdLazyCounter, 6270 mSolverCounterSat, 2925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6284 SdHoareTripleChecker+Valid, 9240 SdHoareTripleChecker+Invalid, 9195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2925 IncrementalHoareTripleChecker+Valid, 6270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:53:47,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6284 Valid, 9240 Invalid, 9195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2925 Valid, 6270 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-07-20 03:53:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2022-07-20 03:53:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 18331. [2022-07-20 03:53:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18331 states, 14142 states have (on average 1.4443501626361193) internal successors, (20426), 14245 states have internal predecessors, (20426), 3567 states have call successors, (3567), 623 states have call predecessors, (3567), 621 states have return successors, (3576), 3537 states have call predecessors, (3576), 3560 states have call successors, (3576) [2022-07-20 03:53:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18331 states to 18331 states and 27569 transitions. [2022-07-20 03:53:48,185 INFO L78 Accepts]: Start accepts. Automaton has 18331 states and 27569 transitions. Word has length 88 [2022-07-20 03:53:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:53:48,185 INFO L495 AbstractCegarLoop]: Abstraction has 18331 states and 27569 transitions. [2022-07-20 03:53:48,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:53:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18331 states and 27569 transitions. [2022-07-20 03:53:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 03:53:48,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:53:48,190 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:53:48,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 03:53:48,190 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:53:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:53:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1002467120, now seen corresponding path program 1 times [2022-07-20 03:53:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:53:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027163560] [2022-07-20 03:53:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:53:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:53:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:53:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:53:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:53:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:53:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:53:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 03:53:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 03:53:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 03:53:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 03:53:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 03:53:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 03:53:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:53:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:53:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 03:53:48,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:53:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027163560] [2022-07-20 03:53:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027163560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:53:48,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:53:48,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:53:48,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367556459] [2022-07-20 03:53:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:53:48,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:53:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:53:48,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:53:48,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:53:48,404 INFO L87 Difference]: Start difference. First operand 18331 states and 27569 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:54:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:01,280 INFO L93 Difference]: Finished difference Result 37985 states and 57538 transitions. [2022-07-20 03:54:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 03:54:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2022-07-20 03:54:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:01,394 INFO L225 Difference]: With dead ends: 37985 [2022-07-20 03:54:01,394 INFO L226 Difference]: Without dead ends: 19709 [2022-07-20 03:54:01,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-20 03:54:01,698 INFO L413 NwaCegarLoop]: 7228 mSDtfsCounter, 9333 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 8841 mSolverCounterSat, 5218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9567 SdHoareTripleChecker+Valid, 15332 SdHoareTripleChecker+Invalid, 14059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5218 IncrementalHoareTripleChecker+Valid, 8841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:01,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9567 Valid, 15332 Invalid, 14059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5218 Valid, 8841 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-20 03:54:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19709 states. [2022-07-20 03:54:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19709 to 18287. [2022-07-20 03:54:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18287 states, 14118 states have (on average 1.4445388865278368) internal successors, (20394), 14222 states have internal predecessors, (20394), 3549 states have call successors, (3549), 618 states have call predecessors, (3549), 619 states have return successors, (3547), 3521 states have call predecessors, (3547), 3539 states have call successors, (3547) [2022-07-20 03:54:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18287 states to 18287 states and 27490 transitions. [2022-07-20 03:54:02,515 INFO L78 Accepts]: Start accepts. Automaton has 18287 states and 27490 transitions. Word has length 98 [2022-07-20 03:54:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:02,516 INFO L495 AbstractCegarLoop]: Abstraction has 18287 states and 27490 transitions. [2022-07-20 03:54:02,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:54:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18287 states and 27490 transitions. [2022-07-20 03:54:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 03:54:02,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:02,520 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:54:02,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 03:54:02,521 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:54:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash 593642895, now seen corresponding path program 1 times [2022-07-20 03:54:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:02,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015594412] [2022-07-20 03:54:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:54:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:54:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:54:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 03:54:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 03:54:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 03:54:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 03:54:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 03:54:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 03:54:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:54:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 03:54:02,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015594412] [2022-07-20 03:54:02,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015594412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:02,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:02,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 03:54:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968086194] [2022-07-20 03:54:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:02,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:54:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:54:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:54:02,779 INFO L87 Difference]: Start difference. First operand 18287 states and 27490 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:54:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:19,508 INFO L93 Difference]: Finished difference Result 24849 states and 38058 transitions. [2022-07-20 03:54:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 03:54:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2022-07-20 03:54:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:19,600 INFO L225 Difference]: With dead ends: 24849 [2022-07-20 03:54:19,600 INFO L226 Difference]: Without dead ends: 21136 [2022-07-20 03:54:19,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-20 03:54:19,625 INFO L413 NwaCegarLoop]: 5587 mSDtfsCounter, 6929 mSDsluCounter, 16447 mSDsCounter, 0 mSdLazyCounter, 16047 mSolverCounterSat, 3357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6932 SdHoareTripleChecker+Valid, 22034 SdHoareTripleChecker+Invalid, 19404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3357 IncrementalHoareTripleChecker+Valid, 16047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:19,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6932 Valid, 22034 Invalid, 19404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3357 Valid, 16047 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-07-20 03:54:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21136 states. [2022-07-20 03:54:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21136 to 16117. [2022-07-20 03:54:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16117 states, 12356 states have (on average 1.4326642926513435) internal successors, (17702), 12452 states have internal predecessors, (17702), 3183 states have call successors, (3183), 576 states have call predecessors, (3183), 577 states have return successors, (3183), 3161 states have call predecessors, (3183), 3175 states have call successors, (3183) [2022-07-20 03:54:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 24068 transitions. [2022-07-20 03:54:20,403 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 24068 transitions. Word has length 98 [2022-07-20 03:54:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:20,403 INFO L495 AbstractCegarLoop]: Abstraction has 16117 states and 24068 transitions. [2022-07-20 03:54:20,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:54:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 24068 transitions. [2022-07-20 03:54:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 03:54:20,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:20,412 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-20 03:54:20,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 03:54:20,413 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:54:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1640846850, now seen corresponding path program 1 times [2022-07-20 03:54:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:20,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300411376] [2022-07-20 03:54:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:54:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:54:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:54:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 03:54:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 03:54:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 03:54:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 03:54:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 03:54:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 03:54:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:54:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:54:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 03:54:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 03:54:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 03:54:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:54:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 03:54:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300411376] [2022-07-20 03:54:20,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300411376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:20,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:20,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 03:54:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391676143] [2022-07-20 03:54:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:20,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:54:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:54:20,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:54:20,769 INFO L87 Difference]: Start difference. First operand 16117 states and 24068 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 03:54:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:38,007 INFO L93 Difference]: Finished difference Result 26996 states and 41029 transitions. [2022-07-20 03:54:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 03:54:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2022-07-20 03:54:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:38,102 INFO L225 Difference]: With dead ends: 26996 [2022-07-20 03:54:38,103 INFO L226 Difference]: Without dead ends: 21120 [2022-07-20 03:54:38,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-20 03:54:38,140 INFO L413 NwaCegarLoop]: 5578 mSDtfsCounter, 7857 mSDsluCounter, 15493 mSDsCounter, 0 mSdLazyCounter, 15925 mSolverCounterSat, 3450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7860 SdHoareTripleChecker+Valid, 21071 SdHoareTripleChecker+Invalid, 19375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3450 IncrementalHoareTripleChecker+Valid, 15925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:38,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7860 Valid, 21071 Invalid, 19375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3450 Valid, 15925 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2022-07-20 03:54:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21120 states. [2022-07-20 03:54:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21120 to 16101. [2022-07-20 03:54:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16101 states, 12348 states have (on average 1.432620667314545) internal successors, (17690), 12444 states have internal predecessors, (17690), 3175 states have call successors, (3175), 576 states have call predecessors, (3175), 577 states have return successors, (3175), 3153 states have call predecessors, (3175), 3167 states have call successors, (3175) [2022-07-20 03:54:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16101 states to 16101 states and 24040 transitions. [2022-07-20 03:54:38,840 INFO L78 Accepts]: Start accepts. Automaton has 16101 states and 24040 transitions. Word has length 126 [2022-07-20 03:54:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:38,841 INFO L495 AbstractCegarLoop]: Abstraction has 16101 states and 24040 transitions. [2022-07-20 03:54:38,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 03:54:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16101 states and 24040 transitions. [2022-07-20 03:54:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-20 03:54:38,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:38,856 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 03:54:38,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 03:54:38,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:54:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 94627519, now seen corresponding path program 1 times [2022-07-20 03:54:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:38,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425798240] [2022-07-20 03:54:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:54:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:54:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:54:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 03:54:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 03:54:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:54:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:54:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:54:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:54:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-20 03:54:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:54:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 03:54:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 03:54:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 03:54:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 03:54:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:54:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:54:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 03:54:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 03:54:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:39,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425798240] [2022-07-20 03:54:39,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425798240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:39,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:39,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 03:54:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680686653] [2022-07-20 03:54:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:54:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:39,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:54:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:54:39,166 INFO L87 Difference]: Start difference. First operand 16101 states and 24040 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-20 03:54:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:56,245 INFO L93 Difference]: Finished difference Result 33359 states and 50181 transitions. [2022-07-20 03:54:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 03:54:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 146 [2022-07-20 03:54:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:56,316 INFO L225 Difference]: With dead ends: 33359 [2022-07-20 03:54:56,316 INFO L226 Difference]: Without dead ends: 17279 [2022-07-20 03:54:56,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-20 03:54:56,358 INFO L413 NwaCegarLoop]: 4308 mSDtfsCounter, 5140 mSDsluCounter, 11093 mSDsCounter, 0 mSdLazyCounter, 15077 mSolverCounterSat, 3030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5140 SdHoareTripleChecker+Valid, 15401 SdHoareTripleChecker+Invalid, 18107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3030 IncrementalHoareTripleChecker+Valid, 15077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:56,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5140 Valid, 15401 Invalid, 18107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3030 Valid, 15077 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2022-07-20 03:54:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17279 states. [2022-07-20 03:54:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17279 to 16095. [2022-07-20 03:54:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16095 states, 12346 states have (on average 1.4317187753118419) internal successors, (17676), 12442 states have internal predecessors, (17676), 3171 states have call successors, (3171), 576 states have call predecessors, (3171), 577 states have return successors, (3171), 3149 states have call predecessors, (3171), 3163 states have call successors, (3171) [2022-07-20 03:54:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16095 states to 16095 states and 24018 transitions. [2022-07-20 03:54:57,008 INFO L78 Accepts]: Start accepts. Automaton has 16095 states and 24018 transitions. Word has length 146 [2022-07-20 03:54:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:57,009 INFO L495 AbstractCegarLoop]: Abstraction has 16095 states and 24018 transitions. [2022-07-20 03:54:57,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-20 03:54:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16095 states and 24018 transitions. [2022-07-20 03:54:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-20 03:54:57,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:57,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:54:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 03:54:57,032 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:54:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1735475427, now seen corresponding path program 1 times [2022-07-20 03:54:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:57,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802688653] [2022-07-20 03:54:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:54:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:54:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:54:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 03:54:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 03:54:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:54:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:54:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:54:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:54:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:54:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 03:54:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:54:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:54:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 03:54:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:54:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:54:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 03:54:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-20 03:54:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 03:54:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 03:54:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 03:54:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 03:54:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 03:54:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 03:54:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 03:54:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:57,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802688653] [2022-07-20 03:54:57,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802688653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:57,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:57,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 03:54:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705713423] [2022-07-20 03:54:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:57,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 03:54:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 03:54:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 03:54:57,389 INFO L87 Difference]: Start difference. First operand 16095 states and 24018 transitions. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 03:55:05,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:10,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:18,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:23,075 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-20 03:55:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:27,574 INFO L93 Difference]: Finished difference Result 41019 states and 63688 transitions. [2022-07-20 03:55:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 03:55:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 193 [2022-07-20 03:55:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:27,698 INFO L225 Difference]: With dead ends: 41019 [2022-07-20 03:55:27,698 INFO L226 Difference]: Without dead ends: 24979 [2022-07-20 03:55:27,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-20 03:55:27,754 INFO L413 NwaCegarLoop]: 5294 mSDtfsCounter, 9228 mSDsluCounter, 11926 mSDsCounter, 0 mSdLazyCounter, 13778 mSolverCounterSat, 5493 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9254 SdHoareTripleChecker+Valid, 17220 SdHoareTripleChecker+Invalid, 19275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5493 IncrementalHoareTripleChecker+Valid, 13778 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:27,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9254 Valid, 17220 Invalid, 19275 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5493 Valid, 13778 Invalid, 4 Unknown, 0 Unchecked, 28.6s Time] [2022-07-20 03:55:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24979 states. [2022-07-20 03:55:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24979 to 16103. [2022-07-20 03:55:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16103 states, 12354 states have (on average 1.4314392099724786) internal successors, (17684), 12450 states have internal predecessors, (17684), 3171 states have call successors, (3171), 576 states have call predecessors, (3171), 577 states have return successors, (3171), 3149 states have call predecessors, (3171), 3163 states have call successors, (3171) [2022-07-20 03:55:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16103 states to 16103 states and 24026 transitions. [2022-07-20 03:55:28,689 INFO L78 Accepts]: Start accepts. Automaton has 16103 states and 24026 transitions. Word has length 193 [2022-07-20 03:55:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:28,690 INFO L495 AbstractCegarLoop]: Abstraction has 16103 states and 24026 transitions. [2022-07-20 03:55:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 03:55:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 16103 states and 24026 transitions. [2022-07-20 03:55:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-20 03:55:28,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:28,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:55:28,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 03:55:28,712 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:55:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2120771259, now seen corresponding path program 1 times [2022-07-20 03:55:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:28,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950067924] [2022-07-20 03:55:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:55:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:55:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:55:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:55:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 03:55:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 03:55:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:55:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:55:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:55:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:55:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:55:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 03:55:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:55:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 03:55:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 03:55:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 03:55:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 03:55:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:55:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 03:55:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 03:55:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 03:55:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 03:55:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 03:55:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 03:55:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 03:55:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:29,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950067924] [2022-07-20 03:55:29,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950067924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:29,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:29,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 03:55:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046042894] [2022-07-20 03:55:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 03:55:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 03:55:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 03:55:29,074 INFO L87 Difference]: Start difference. First operand 16103 states and 24026 transitions. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-20 03:55:40,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:58,045 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-20 03:56:00,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=false, quantifiers [] [2022-07-20 03:56:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:02,701 INFO L93 Difference]: Finished difference Result 36027 states and 55309 transitions. [2022-07-20 03:56:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 03:56:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 194 [2022-07-20 03:56:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:02,791 INFO L225 Difference]: With dead ends: 36027 [2022-07-20 03:56:02,791 INFO L226 Difference]: Without dead ends: 19947 [2022-07-20 03:56:02,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-07-20 03:56:02,835 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 6663 mSDsluCounter, 13852 mSDsCounter, 0 mSdLazyCounter, 22005 mSolverCounterSat, 4789 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6664 SdHoareTripleChecker+Valid, 18024 SdHoareTripleChecker+Invalid, 26797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4789 IncrementalHoareTripleChecker+Valid, 22005 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:02,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6664 Valid, 18024 Invalid, 26797 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4789 Valid, 22005 Invalid, 3 Unknown, 0 Unchecked, 31.9s Time] [2022-07-20 03:56:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2022-07-20 03:56:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 16117. [2022-07-20 03:56:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16117 states, 12362 states have (on average 1.4306746481151917) internal successors, (17686), 12458 states have internal predecessors, (17686), 3177 states have call successors, (3177), 576 states have call predecessors, (3177), 577 states have return successors, (3177), 3155 states have call predecessors, (3177), 3169 states have call successors, (3177) [2022-07-20 03:56:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 24040 transitions. [2022-07-20 03:56:03,633 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 24040 transitions. Word has length 194 [2022-07-20 03:56:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:03,634 INFO L495 AbstractCegarLoop]: Abstraction has 16117 states and 24040 transitions. [2022-07-20 03:56:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-20 03:56:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 24040 transitions. [2022-07-20 03:56:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-20 03:56:03,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:03,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:56:03,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 03:56:03,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 03:56:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -807176600, now seen corresponding path program 1 times [2022-07-20 03:56:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:03,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045892928] [2022-07-20 03:56:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:56:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:56:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:56:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 03:56:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 03:56:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 03:56:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:56:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:56:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:56:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 03:56:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:56:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 03:56:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 03:56:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 03:56:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:56:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 03:56:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 03:56:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 03:56:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 03:56:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:56:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:56:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 03:56:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-20 03:56:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 03:56:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 03:56:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-20 03:56:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 03:56:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 03:56:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 03:56:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 03:56:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 03:56:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-20 03:56:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:04,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045892928] [2022-07-20 03:56:04,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045892928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:04,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:04,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 03:56:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326163550] [2022-07-20 03:56:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:04,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 03:56:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 03:56:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 03:56:04,089 INFO L87 Difference]: Start difference. First operand 16117 states and 24040 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36)