./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.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 f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:18:22,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:18:22,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:18:22,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:18:22,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:18:22,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:18:22,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:18:22,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:18:22,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:18:22,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:18:22,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:18:22,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:18:22,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:18:22,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:18:22,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:18:22,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:18:22,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:18:22,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:18:22,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:18:22,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:18:22,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:18:22,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:18:22,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:18:22,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:18:22,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:18:23,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:18:23,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:18:23,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:18:23,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:18:23,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:18:23,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:18:23,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:18:23,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:18:23,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:18:23,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:18:23,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:18:23,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:18:23,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:18:23,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:18:23,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:18:23,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:18:23,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:18:23,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:18:23,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:18:23,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:18:23,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:18:23,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:18:23,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:18:23,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:18:23,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:18:23,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:18:23,039 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:18:23,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:18:23,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:18:23,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:18:23,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:18:23,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:18:23,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:18:23,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:18:23,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:18:23,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:18:23,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:18:23,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:18:23,043 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:18:23,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:18:23,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:18:23,043 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 -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2022-07-12 11:18:23,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:18:23,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:18:23,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:18:23,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:18:23,223 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:18:23,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-12 11:18:23,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaf034a8/205cdf2f26cc45fbb3da04f0d3043a97/FLAGe4c4146b6 [2022-07-12 11:18:23,854 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:18:23,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-12 11:18:23,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaf034a8/205cdf2f26cc45fbb3da04f0d3043a97/FLAGe4c4146b6 [2022-07-12 11:18:24,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaf034a8/205cdf2f26cc45fbb3da04f0d3043a97 [2022-07-12 11:18:24,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:18:24,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:18:24,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:18:24,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:18:24,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:18:24,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:18:24" (1/1) ... [2022-07-12 11:18:24,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d21a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:24, skipping insertion in model container [2022-07-12 11:18:24,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:18:24" (1/1) ... [2022-07-12 11:18:24,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:18:24,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:18:25,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-12 11:18:25,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:18:25,629 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:18:25,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-12 11:18:25,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:18:25,993 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:18:25,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25 WrapperNode [2022-07-12 11:18:25,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:18:25,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:18:25,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:18:25,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:18:26,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,197 INFO L137 Inliner]: procedures = 309, calls = 2432, calls flagged for inlining = 139, calls inlined = 90, statements flattened = 3953 [2022-07-12 11:18:26,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:18:26,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:18:26,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:18:26,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:18:26,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:18:26,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:18:26,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:18:26,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:18:26,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (1/1) ... [2022-07-12 11:18:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:18:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:26,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:18:26,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:18:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 11:18:26,481 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 11:18:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 11:18:26,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 11:18:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_ctl_ioctl [2022-07-12 11:18:26,481 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_ctl_ioctl [2022-07-12 11:18:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_release [2022-07-12 11:18:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_release [2022-07-12 11:18:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2022-07-12 11:18:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2022-07-12 11:18:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:18:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:18:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_disc_info [2022-07-12 11:18:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_disc_info [2022-07-12 11:18:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_bio_alloc [2022-07-12 11:18:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_bio_alloc [2022-07-12 11:18:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:18:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:18:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_setup_dev [2022-07-12 11:18:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_setup_dev [2022-07-12 11:18:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-12 11:18:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-12 11:18:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure bdget [2022-07-12 11:18:26,483 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget [2022-07-12 11:18:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_set_speed [2022-07-12 11:18:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_set_speed [2022-07-12 11:18:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure bdevname [2022-07-12 11:18:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure bdevname [2022-07-12 11:18:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 11:18:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 11:18:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_shrink_pktlist [2022-07-12 11:18:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_shrink_pktlist [2022-07-12 11:18:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:18:26,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:18:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-12 11:18:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-12 11:18:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 11:18:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 11:18:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 11:18:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 11:18:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-12 11:18:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-12 11:18:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure new_encode_dev [2022-07-12 11:18:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure new_encode_dev [2022-07-12 11:18:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 11:18:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 11:18:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_select [2022-07-12 11:18:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_select [2022-07-12 11:18:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_remove [2022-07-12 11:18:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_remove [2022-07-12 11:18:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-12 11:18:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-12 11:18:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_debugfs_cleanup [2022-07-12 11:18:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_debugfs_cleanup [2022-07-12 11:18:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:18:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 11:18:26,488 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 11:18:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure bio_init [2022-07-12 11:18:26,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_init [2022-07-12 11:18:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure set_blocksize [2022-07-12 11:18:26,489 INFO L138 BoogieDeclarations]: Found implementation of procedure set_blocksize [2022-07-12 11:18:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_dump_sense [2022-07-12 11:18:26,489 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_dump_sense [2022-07-12 11:18:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_create_kmalloc_pool [2022-07-12 11:18:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_create_kmalloc_pool [2022-07-12 11:18:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-12 11:18:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-12 11:18:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:18:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2022-07-12 11:18:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2022-07-12 11:18:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_lock_door [2022-07-12 11:18:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_lock_door [2022-07-12 11:18:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_get [2022-07-12 11:18:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_get [2022-07-12 11:18:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_remove_dev [2022-07-12 11:18:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_remove_dev [2022-07-12 11:18:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2022-07-12 11:18:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2022-07-12 11:18:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:18:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:18:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:18:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure bio_put [2022-07-12 11:18:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_put [2022-07-12 11:18:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:18:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 11:18:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 11:18:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 11:18:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 11:18:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2022-07-12 11:18:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2022-07-12 11:18:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_dir [2022-07-12 11:18:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_dir [2022-07-12 11:18:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 11:18:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 11:18:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 11:18:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 11:18:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 11:18:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 11:18:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 11:18:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-12 11:18:26,496 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_sysfs_cleanup [2022-07-12 11:18:26,496 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_sysfs_cleanup [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_init [2022-07-12 11:18:26,496 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_init [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_find_dev_from_minor [2022-07-12 11:18:26,496 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_find_dev_from_minor [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:18:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 11:18:26,497 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 11:18:26,497 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 11:18:26,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 11:18:26,497 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 11:18:26,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 11:18:26,497 INFO L130 BoogieDeclarations]: Found specification of procedure init_write_congestion_marks [2022-07-12 11:18:26,497 INFO L138 BoogieDeclarations]: Found implementation of procedure init_write_congestion_marks [2022-07-12 11:18:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-12 11:18:26,498 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-12 11:18:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:18:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_track_info [2022-07-12 11:18:26,500 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_track_info [2022-07-12 11:18:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:18:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2022-07-12 11:18:26,501 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2022-07-12 11:18:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:18:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:18:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure new_decode_dev [2022-07-12 11:18:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure new_decode_dev [2022-07-12 11:18:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 11:18:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 11:18:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_create [2022-07-12 11:18:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_create [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:18:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-12 11:18:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-12 11:18:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:18:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_put [2022-07-12 11:18:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_put [2022-07-12 11:18:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:18:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-12 11:18:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-12 11:18:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure queue_max_segments [2022-07-12 11:18:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_max_segments [2022-07-12 11:18:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2022-07-12 11:18:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2022-07-12 11:18:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure init_cdrom_command [2022-07-12 11:18:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure init_cdrom_command [2022-07-12 11:18:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-12 11:18:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-12 11:18:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_sense [2022-07-12 11:18:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_sense [2022-07-12 11:18:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-12 11:18:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-12 11:18:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_generic_packet [2022-07-12 11:18:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_generic_packet [2022-07-12 11:18:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-12 11:18:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 11:18:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2022-07-12 11:18:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_flush_cache [2022-07-12 11:18:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_flush_cache [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:18:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:18:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 11:18:26,510 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 11:18:26,926 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:18:26,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:18:27,032 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,115 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-12 11:18:27,115 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-12 11:18:27,825 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,830 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,830 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,832 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,835 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,837 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:27,841 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:18:31,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2022-07-12 11:18:31,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2022-07-12 11:18:31,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##282: assume !false; [2022-07-12 11:18:31,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##281: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##214: assume !false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##324: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume !false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##152: assume false; [2022-07-12 11:18:31,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume !false; [2022-07-12 11:18:31,032 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:18:31,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:18:31,044 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:18:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:18:31 BoogieIcfgContainer [2022-07-12 11:18:31,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:18:31,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:18:31,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:18:31,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:18:31,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:18:24" (1/3) ... [2022-07-12 11:18:31,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fad726e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:18:31, skipping insertion in model container [2022-07-12 11:18:31,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:18:25" (2/3) ... [2022-07-12 11:18:31,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fad726e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:18:31, skipping insertion in model container [2022-07-12 11:18:31,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:18:31" (3/3) ... [2022-07-12 11:18:31,051 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-12 11:18:31,060 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:18:31,061 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:18:31,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:18:31,111 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@3f8e6753, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56705745 [2022-07-12 11:18:31,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:18:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2022-07-12 11:18:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 11:18:31,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:31,122 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] [2022-07-12 11:18:31,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1322109639, now seen corresponding path program 1 times [2022-07-12 11:18:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:31,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804250642] [2022-07-12 11:18:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:18:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:31,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804250642] [2022-07-12 11:18:31,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804250642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:31,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:31,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:18:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562233000] [2022-07-12 11:18:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:18:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:18:31,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:18:31,664 INFO L87 Difference]: Start difference. First operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:18:34,377 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-12 11:18:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:36,214 INFO L93 Difference]: Finished difference Result 3723 states and 5356 transitions. [2022-07-12 11:18:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:18:36,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-12 11:18:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:36,238 INFO L225 Difference]: With dead ends: 3723 [2022-07-12 11:18:36,238 INFO L226 Difference]: Without dead ends: 2511 [2022-07-12 11:18:36,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:18:36,258 INFO L413 NwaCegarLoop]: 1879 mSDtfsCounter, 2128 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 673 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 3908 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:36,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 3908 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1107 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 11:18:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-07-12 11:18:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2314. [2022-07-12 11:18:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.3114457831325301) internal successors, (2177), 1693 states have internal predecessors, (2177), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:18:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3172 transitions. [2022-07-12 11:18:36,401 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3172 transitions. Word has length 23 [2022-07-12 11:18:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:36,402 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3172 transitions. [2022-07-12 11:18:36,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:18:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3172 transitions. [2022-07-12 11:18:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 11:18:36,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:36,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:18:36,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:18:36,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1781808508, now seen corresponding path program 1 times [2022-07-12 11:18:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:36,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890302302] [2022-07-12 11:18:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:18:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:18:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:18:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:18:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:18:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:18:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:18:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:18:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:18:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:18:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:18:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:18:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:18:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:18:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 11:18:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:36,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890302302] [2022-07-12 11:18:36,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890302302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:36,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:36,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:18:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104499505] [2022-07-12 11:18:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:36,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:18:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:18:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:18:36,709 INFO L87 Difference]: Start difference. First operand 2314 states and 3172 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 11:18:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:40,071 INFO L93 Difference]: Finished difference Result 4811 states and 6660 transitions. [2022-07-12 11:18:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:18:40,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2022-07-12 11:18:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:40,082 INFO L225 Difference]: With dead ends: 4811 [2022-07-12 11:18:40,082 INFO L226 Difference]: Without dead ends: 2546 [2022-07-12 11:18:40,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:18:40,089 INFO L413 NwaCegarLoop]: 1544 mSDtfsCounter, 919 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 4803 SdHoareTripleChecker+Invalid, 3953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:40,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 4803 Invalid, 3953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 11:18:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-12 11:18:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2314. [2022-07-12 11:18:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.310843373493976) internal successors, (2176), 1693 states have internal predecessors, (2176), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:18:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3171 transitions. [2022-07-12 11:18:40,154 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3171 transitions. Word has length 138 [2022-07-12 11:18:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:40,154 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3171 transitions. [2022-07-12 11:18:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 11:18:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3171 transitions. [2022-07-12 11:18:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 11:18:40,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:40,164 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:18:40,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:18:40,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -852391828, now seen corresponding path program 1 times [2022-07-12 11:18:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689095582] [2022-07-12 11:18:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:18:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:18:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:18:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:18:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:18:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:18:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:18:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:18:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:18:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:18:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:18:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:18:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:18:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:18:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:18:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 11:18:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:40,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689095582] [2022-07-12 11:18:40,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689095582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:40,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:40,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:18:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311333860] [2022-07-12 11:18:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:40,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:18:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:18:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:18:40,454 INFO L87 Difference]: Start difference. First operand 2314 states and 3171 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:18:43,797 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-12 11:18:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:44,974 INFO L93 Difference]: Finished difference Result 4913 states and 6821 transitions. [2022-07-12 11:18:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:18:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2022-07-12 11:18:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:44,986 INFO L225 Difference]: With dead ends: 4913 [2022-07-12 11:18:44,986 INFO L226 Difference]: Without dead ends: 2650 [2022-07-12 11:18:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:18:44,994 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 1353 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 1036 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:44,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 3471 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 1819 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 11:18:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-07-12 11:18:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2324. [2022-07-12 11:18:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.311377245508982) internal successors, (2190), 1703 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:18:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3185 transitions. [2022-07-12 11:18:45,056 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3185 transitions. Word has length 145 [2022-07-12 11:18:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:45,057 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3185 transitions. [2022-07-12 11:18:45,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:18:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3185 transitions. [2022-07-12 11:18:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 11:18:45,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:45,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:18:45,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:18:45,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash 439921461, now seen corresponding path program 1 times [2022-07-12 11:18:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:45,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078803511] [2022-07-12 11:18:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 11:18:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:18:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:18:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:18:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:18:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:18:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:18:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:18:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:18:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:18:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:18:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:18:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:18:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:18:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 11:18:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:45,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078803511] [2022-07-12 11:18:45,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078803511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:45,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:45,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:18:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254988322] [2022-07-12 11:18:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:45,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:18:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:18:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:18:45,335 INFO L87 Difference]: Start difference. First operand 2324 states and 3185 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:18:47,950 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-12 11:18:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:50,856 INFO L93 Difference]: Finished difference Result 4833 states and 6690 transitions. [2022-07-12 11:18:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:18:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2022-07-12 11:18:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:50,868 INFO L225 Difference]: With dead ends: 4833 [2022-07-12 11:18:50,868 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 11:18:50,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:18:50,877 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 1244 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 959 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 959 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:50,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 5006 Invalid, 4623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [959 Valid, 3663 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 11:18:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 11:18:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-12 11:18:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3107784431137726) internal successors, (2189), 1702 states have internal predecessors, (2189), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:18:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3184 transitions. [2022-07-12 11:18:50,945 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3184 transitions. Word has length 142 [2022-07-12 11:18:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:50,946 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3184 transitions. [2022-07-12 11:18:50,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:18:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3184 transitions. [2022-07-12 11:18:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 11:18:50,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:50,949 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:18:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:18:50,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1210414124, now seen corresponding path program 1 times [2022-07-12 11:18:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:50,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17932265] [2022-07-12 11:18:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:18:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:18:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:18:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:18:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:18:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:18:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:18:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:18:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:18:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:18:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:18:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:18:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:18:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:18:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:18:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:18:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:51,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17932265] [2022-07-12 11:18:51,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17932265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:51,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:51,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:18:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495981647] [2022-07-12 11:18:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:18:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:18:51,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:18:51,257 INFO L87 Difference]: Start difference. First operand 2324 states and 3184 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:18:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:55,545 INFO L93 Difference]: Finished difference Result 4867 states and 6734 transitions. [2022-07-12 11:18:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:18:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 172 [2022-07-12 11:18:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:55,556 INFO L225 Difference]: With dead ends: 4867 [2022-07-12 11:18:55,556 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 11:18:55,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:18:55,563 INFO L413 NwaCegarLoop]: 1529 mSDtfsCounter, 927 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 5133 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 6279 SdHoareTripleChecker+Invalid, 5791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 5133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:55,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 6279 Invalid, 5791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 5133 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 11:18:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 11:18:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-12 11:18:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3101796407185629) internal successors, (2188), 1702 states have internal predecessors, (2188), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:18:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3183 transitions. [2022-07-12 11:18:55,622 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3183 transitions. Word has length 172 [2022-07-12 11:18:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3183 transitions. [2022-07-12 11:18:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:18:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3183 transitions. [2022-07-12 11:18:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 11:18:55,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:55,626 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:18:55,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:18:55,626 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -848117149, now seen corresponding path program 1 times [2022-07-12 11:18:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:55,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475626910] [2022-07-12 11:18:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:18:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:18:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:18:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:18:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:18:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:18:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:18:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:18:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:18:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:18:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 11:18:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:18:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:18:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:18:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:18:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:18:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:18:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475626910] [2022-07-12 11:18:55,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475626910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:55,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:55,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:18:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66515145] [2022-07-12 11:18:55,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:55,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:18:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:18:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:18:55,880 INFO L87 Difference]: Start difference. First operand 2324 states and 3183 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:19:00,208 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-12 11:19:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:02,724 INFO L93 Difference]: Finished difference Result 7831 states and 11495 transitions. [2022-07-12 11:19:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:19:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 174 [2022-07-12 11:19:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:02,748 INFO L225 Difference]: With dead ends: 7831 [2022-07-12 11:19:02,749 INFO L226 Difference]: Without dead ends: 5550 [2022-07-12 11:19:02,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:19:02,757 INFO L413 NwaCegarLoop]: 3014 mSDtfsCounter, 2712 mSDsluCounter, 7185 mSDsCounter, 0 mSdLazyCounter, 4855 mSolverCounterSat, 987 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 10199 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 987 IncrementalHoareTripleChecker+Valid, 4855 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:02,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 10199 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [987 Valid, 4855 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 11:19:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2022-07-12 11:19:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 2326. [2022-07-12 11:19:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 1672 states have (on average 1.3098086124401913) internal successors, (2190), 1704 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-12 11:19:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3185 transitions. [2022-07-12 11:19:02,854 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3185 transitions. Word has length 174 [2022-07-12 11:19:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:02,855 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3185 transitions. [2022-07-12 11:19:02,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:19:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3185 transitions. [2022-07-12 11:19:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 11:19:02,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:02,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:19:02,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:19:02,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1490806641, now seen corresponding path program 1 times [2022-07-12 11:19:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:02,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241994048] [2022-07-12 11:19:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:19:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:19:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:19:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:19:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:19:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:19:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:19:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:19:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:19:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:19:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:19:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:19:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:19:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:19:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:19:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 11:19:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 11:19:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:03,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241994048] [2022-07-12 11:19:03,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241994048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:03,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901693112] [2022-07-12 11:19:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:03,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:19:03,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:19:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:03,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 11:19:03,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 11:19:03,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:19:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901693112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:19:03,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:19:03,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 11:19:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961191734] [2022-07-12 11:19:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:19:03,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:19:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:19:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:19:03,945 INFO L87 Difference]: Start difference. First operand 2326 states and 3185 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:19:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:04,097 INFO L93 Difference]: Finished difference Result 4637 states and 6351 transitions. [2022-07-12 11:19:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:19:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 179 [2022-07-12 11:19:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:04,106 INFO L225 Difference]: With dead ends: 4637 [2022-07-12 11:19:04,107 INFO L226 Difference]: Without dead ends: 2304 [2022-07-12 11:19:04,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:19:04,114 INFO L413 NwaCegarLoop]: 1620 mSDtfsCounter, 15 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:04,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9692 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:19:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-07-12 11:19:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2022-07-12 11:19:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1659 states have (on average 1.3092224231464737) internal successors, (2172), 1690 states have internal predecessors, (2172), 491 states have call successors, (491), 154 states have call predecessors, (491), 153 states have return successors, (492), 483 states have call predecessors, (492), 489 states have call successors, (492) [2022-07-12 11:19:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3155 transitions. [2022-07-12 11:19:04,190 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3155 transitions. Word has length 179 [2022-07-12 11:19:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:04,190 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3155 transitions. [2022-07-12 11:19:04,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:19:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3155 transitions. [2022-07-12 11:19:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 11:19:04,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:04,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 11:19:04,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 11:19:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:04,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 255731860, now seen corresponding path program 1 times [2022-07-12 11:19:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667656380] [2022-07-12 11:19:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:19:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:19:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:19:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:19:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:19:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:19:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:19:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:19:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:19:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:19:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:19:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:19:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:19:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:19:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:19:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 11:19:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 11:19:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 11:19:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667656380] [2022-07-12 11:19:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667656380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:19:04,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:19:04,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:19:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137600113] [2022-07-12 11:19:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:19:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:19:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:19:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:19:04,703 INFO L87 Difference]: Start difference. First operand 2304 states and 3155 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:19:08,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:09,089 INFO L93 Difference]: Finished difference Result 4861 states and 6721 transitions. [2022-07-12 11:19:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:19:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 198 [2022-07-12 11:19:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:09,099 INFO L225 Difference]: With dead ends: 4861 [2022-07-12 11:19:09,099 INFO L226 Difference]: Without dead ends: 2588 [2022-07-12 11:19:09,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:19:09,105 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 2457 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 1340 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1340 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:09,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2596 Valid, 2686 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1340 Valid, 936 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 11:19:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2022-07-12 11:19:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2339. [2022-07-12 11:19:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1682 states have (on average 1.302615933412604) internal successors, (2191), 1713 states have internal predecessors, (2191), 496 states have call successors, (496), 161 states have call predecessors, (496), 160 states have return successors, (497), 488 states have call predecessors, (497), 494 states have call successors, (497) [2022-07-12 11:19:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3184 transitions. [2022-07-12 11:19:09,188 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3184 transitions. Word has length 198 [2022-07-12 11:19:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 2339 states and 3184 transitions. [2022-07-12 11:19:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:19:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3184 transitions. [2022-07-12 11:19:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 11:19:09,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:09,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 11:19:09,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:19:09,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1595536580, now seen corresponding path program 1 times [2022-07-12 11:19:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:09,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318300543] [2022-07-12 11:19:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:19:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:19:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:19:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:19:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:19:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:19:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:19:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:19:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:19:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:19:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:19:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:19:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:19:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:19:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:19:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 11:19:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:19:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318300543] [2022-07-12 11:19:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318300543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345427597] [2022-07-12 11:19:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:09,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:19:09,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:19:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:19:10,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 11:19:10,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:19:10,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345427597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:19:10,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:19:10,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-12 11:19:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935716088] [2022-07-12 11:19:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:19:10,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:19:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:19:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:19:10,249 INFO L87 Difference]: Start difference. First operand 2339 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:19:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:10,443 INFO L93 Difference]: Finished difference Result 4625 states and 6318 transitions. [2022-07-12 11:19:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:19:10,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2022-07-12 11:19:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:10,459 INFO L225 Difference]: With dead ends: 4625 [2022-07-12 11:19:10,459 INFO L226 Difference]: Without dead ends: 2349 [2022-07-12 11:19:10,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:19:10,467 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 15 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7977 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:10,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7977 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:19:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-12 11:19:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2347. [2022-07-12 11:19:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1689 states have (on average 1.3013617525162817) internal successors, (2198), 1721 states have internal predecessors, (2198), 496 states have call successors, (496), 161 states have call predecessors, (496), 161 states have return successors, (499), 488 states have call predecessors, (499), 494 states have call successors, (499) [2022-07-12 11:19:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3193 transitions. [2022-07-12 11:19:10,550 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3193 transitions. Word has length 193 [2022-07-12 11:19:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:10,550 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3193 transitions. [2022-07-12 11:19:10,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:19:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3193 transitions. [2022-07-12 11:19:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 11:19:10,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:10,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 11:19:10,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 11:19:10,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:19:10,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -388855203, now seen corresponding path program 1 times [2022-07-12 11:19:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:10,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803670556] [2022-07-12 11:19:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:19:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:19:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:19:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:19:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:19:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:19:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:19:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:19:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:19:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:19:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:19:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:19:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:19:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 11:19:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 11:19:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:19:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 11:19:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:19:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:11,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803670556] [2022-07-12 11:19:11,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803670556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:11,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894414177] [2022-07-12 11:19:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:11,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:19:11,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:19:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:11,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 3231 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 11:19:11,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 11:19:11,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:19:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894414177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:19:11,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:19:11,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 19 [2022-07-12 11:19:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308014868] [2022-07-12 11:19:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:19:11,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:19:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:19:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:19:11,972 INFO L87 Difference]: Start difference. First operand 2347 states and 3193 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 11:19:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:12,339 INFO L93 Difference]: Finished difference Result 4685 states and 6403 transitions. [2022-07-12 11:19:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:19:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) Word has length 196 [2022-07-12 11:19:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:12,347 INFO L225 Difference]: With dead ends: 4685 [2022-07-12 11:19:12,347 INFO L226 Difference]: Without dead ends: 2373 [2022-07-12 11:19:12,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:19:12,353 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 65 mSDsluCounter, 14432 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 16043 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:12,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 16043 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:19:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-07-12 11:19:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2349. [2022-07-12 11:19:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1690 states have (on average 1.3011834319526627) internal successors, (2199), 1723 states have internal predecessors, (2199), 496 states have call successors, (496), 161 states have call predecessors, (496), 162 states have return successors, (500), 488 states have call predecessors, (500), 494 states have call successors, (500) [2022-07-12 11:19:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3195 transitions. [2022-07-12 11:19:12,434 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3195 transitions. Word has length 196 [2022-07-12 11:19:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:12,434 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3195 transitions. [2022-07-12 11:19:12,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 11:19:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3195 transitions. [2022-07-12 11:19:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-12 11:19:12,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:12,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-12 11:19:12,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:19:12,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:12,659 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 173882668, now seen corresponding path program 1 times [2022-07-12 11:19:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356827432] [2022-07-12 11:19:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:19:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:19:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:19:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:19:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:19:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:19:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:19:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:19:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:19:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:19:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:19:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:19:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 11:19:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:19:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 11:19:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 11:19:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 11:19:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 11:19:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356827432] [2022-07-12 11:19:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356827432] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034446361] [2022-07-12 11:19:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:12,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:12,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:19:12,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:19:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:13,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-12 11:19:13,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:13,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:13,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:13,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:13,736 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:19:13,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:19:13,951 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:19:13,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:19:14,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:19:14,723 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:19:14,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:19:14,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:14,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:14,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:19:15,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:19:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:15,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:15,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:15,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:16,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:19:16,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:19:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 11:19:16,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:19:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034446361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:17,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:19:17,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 32 [2022-07-12 11:19:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545620662] [2022-07-12 11:19:17,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:19:17,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 11:19:17,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:17,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 11:19:17,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1248, Unknown=6, NotChecked=0, Total=1406 [2022-07-12 11:19:17,358 INFO L87 Difference]: Start difference. First operand 2349 states and 3195 transitions. Second operand has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-12 11:19:25,551 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-12 11:19:28,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:30,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:32,936 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-12 11:19:35,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:37,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:39,966 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-12 11:19:42,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:44,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:19:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:47,777 INFO L93 Difference]: Finished difference Result 4936 states and 6774 transitions. [2022-07-12 11:19:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 11:19:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) Word has length 203 [2022-07-12 11:19:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:47,787 INFO L225 Difference]: With dead ends: 4936 [2022-07-12 11:19:47,787 INFO L226 Difference]: Without dead ends: 2590 [2022-07-12 11:19:47,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2430, Unknown=6, NotChecked=0, Total=2756 [2022-07-12 11:19:47,795 INFO L413 NwaCegarLoop]: 1527 mSDtfsCounter, 940 mSDsluCounter, 11744 mSDsCounter, 0 mSdLazyCounter, 11299 mSolverCounterSat, 665 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 13271 SdHoareTripleChecker+Invalid, 18505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 11299 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 6532 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:47,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 13271 Invalid, 18505 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [665 Valid, 11299 Invalid, 9 Unknown, 6532 Unchecked, 29.5s Time] [2022-07-12 11:19:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-12 11:19:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2358. [2022-07-12 11:19:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1697 states have (on average 1.299351797289334) internal successors, (2205), 1729 states have internal predecessors, (2205), 497 states have call successors, (497), 163 states have call predecessors, (497), 163 states have return successors, (500), 489 states have call predecessors, (500), 495 states have call successors, (500) [2022-07-12 11:19:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3202 transitions. [2022-07-12 11:19:47,932 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3202 transitions. Word has length 203 [2022-07-12 11:19:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:47,933 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3202 transitions. [2022-07-12 11:19:47,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-12 11:19:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3202 transitions. [2022-07-12 11:19:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-12 11:19:47,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:47,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:19:47,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:19:48,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:48,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 781303217, now seen corresponding path program 2 times [2022-07-12 11:19:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302842429] [2022-07-12 11:19:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:19:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:19:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:19:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:19:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:19:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:19:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:19:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:19:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:19:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:19:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 11:19:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:19:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:19:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:19:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 11:19:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 11:19:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 11:19:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 11:19:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 11:19:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 11:19:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302842429] [2022-07-12 11:19:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302842429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871398482] [2022-07-12 11:19:48,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:19:48,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:48,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:19:48,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:19:49,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:19:49,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:19:49,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-12 11:19:49,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:49,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:49,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:49,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:49,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:50,038 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:19:50,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:19:50,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:19:50,377 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:19:50,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:19:50,572 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 11:19:50,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 11:19:50,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:19:51,589 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 11:19:51,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 11:19:51,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:51,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:51,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-12 11:19:52,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:19:52,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-12 11:19:53,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:53,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:53,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:19:53,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:19:53,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:19:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:19:53,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:19:54,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871398482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:54,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:19:54,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 38 [2022-07-12 11:19:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856234218] [2022-07-12 11:19:54,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:19:54,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 11:19:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 11:19:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1680, Unknown=9, NotChecked=0, Total=1892 [2022-07-12 11:19:54,875 INFO L87 Difference]: Start difference. First operand 2358 states and 3202 transitions. Second operand has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-12 11:20:07,494 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-12 11:20:09,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:11,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:13,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:15,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:17,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:19,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:22,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:24,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:26,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:28,546 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-12 11:20:30,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:32,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:34,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:36,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:38,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:41,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:43,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:45,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:47,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:20:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:20:55,181 INFO L93 Difference]: Finished difference Result 7358 states and 10175 transitions. [2022-07-12 11:20:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 11:20:55,182 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) Word has length 210 [2022-07-12 11:20:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:20:55,197 INFO L225 Difference]: With dead ends: 7358 [2022-07-12 11:20:55,197 INFO L226 Difference]: Without dead ends: 5066 [2022-07-12 11:20:55,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=459, Invalid=4362, Unknown=9, NotChecked=0, Total=4830 [2022-07-12 11:20:55,205 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 2563 mSDsluCounter, 29182 mSDsCounter, 0 mSdLazyCounter, 20771 mSolverCounterSat, 1478 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2804 SdHoareTripleChecker+Valid, 32119 SdHoareTripleChecker+Invalid, 42484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1478 IncrementalHoareTripleChecker+Valid, 20771 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 20216 IncrementalHoareTripleChecker+Unchecked, 58.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:20:55,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2804 Valid, 32119 Invalid, 42484 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1478 Valid, 20771 Invalid, 19 Unknown, 20216 Unchecked, 58.6s Time] [2022-07-12 11:20:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-07-12 11:20:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4604. [2022-07-12 11:20:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 3316 states have (on average 1.3027744270205066) internal successors, (4320), 3383 states have internal predecessors, (4320), 967 states have call successors, (967), 314 states have call predecessors, (967), 320 states have return successors, (999), 954 states have call predecessors, (999), 965 states have call successors, (999) [2022-07-12 11:20:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6286 transitions. [2022-07-12 11:20:55,411 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6286 transitions. Word has length 210 [2022-07-12 11:20:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:20:55,412 INFO L495 AbstractCegarLoop]: Abstraction has 4604 states and 6286 transitions. [2022-07-12 11:20:55,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-12 11:20:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6286 transitions. [2022-07-12 11:20:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-12 11:20:55,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:20:55,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:20:55,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:20:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:20:55,640 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:20:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:20:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1144769715, now seen corresponding path program 1 times [2022-07-12 11:20:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:20:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901205399] [2022-07-12 11:20:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:20:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:20:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:20:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:20:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:20:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:20:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:20:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:20:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:20:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:20:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:20:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:20:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:20:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:20:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 11:20:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:20:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:20:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:20:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 11:20:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 11:20:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 11:20:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 11:20:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 11:20:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:20:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:20:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901205399] [2022-07-12 11:20:57,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901205399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:20:57,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405257355] [2022-07-12 11:20:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:20:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:20:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:20:57,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:20:57,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:20:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:58,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-12 11:20:58,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:20:58,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:58,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:20:58,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:58,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:20:58,770 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:20:58,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:20:59,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:20:59,209 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:20:59,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:20:59,307 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:20:59,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:20:59,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:21:00,342 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:21:00,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:21:00,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:21:00,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:21:00,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:21:01,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:21:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:01,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:21:01,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:21:01,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:21:01,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:21:01,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:21:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 11:21:01,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:21:02,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| Int) (v_ArrVal_838 Int) (v_ArrVal_839 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_838))) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|)) (not (= (select .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27|) 0)) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_841) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_839) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|)) 18446744073709551616) 0) (not (= (select (store .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|) 0))))) is different from false [2022-07-12 11:21:02,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405257355] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:21:02,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:21:02,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2022-07-12 11:21:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25089372] [2022-07-12 11:21:02,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:21:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 11:21:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 11:21:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1926, Unknown=2, NotChecked=90, Total=2256 [2022-07-12 11:21:02,369 INFO L87 Difference]: Start difference. First operand 4604 states and 6286 transitions. Second operand has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-12 11:21:08,640 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-12 11:21:10,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:12,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:14,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:17,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:19,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:21,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:23,363 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-12 11:21:25,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:27,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:29,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:40,457 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-12 11:21:42,543 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-12 11:21:44,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:50,932 INFO L93 Difference]: Finished difference Result 8430 states and 11667 transitions. [2022-07-12 11:21:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-12 11:21:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) Word has length 210 [2022-07-12 11:21:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:50,953 INFO L225 Difference]: With dead ends: 8430 [2022-07-12 11:21:50,953 INFO L226 Difference]: Without dead ends: 6131 [2022-07-12 11:21:50,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=973, Invalid=7771, Unknown=2, NotChecked=184, Total=8930 [2022-07-12 11:21:50,963 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 4860 mSDsluCounter, 10067 mSDsCounter, 0 mSdLazyCounter, 19330 mSolverCounterSat, 3103 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4939 SdHoareTripleChecker+Valid, 11540 SdHoareTripleChecker+Invalid, 26076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3103 IncrementalHoareTripleChecker+Valid, 19330 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 3629 IncrementalHoareTripleChecker+Unchecked, 46.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:50,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4939 Valid, 11540 Invalid, 26076 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3103 Valid, 19330 Invalid, 14 Unknown, 3629 Unchecked, 46.4s Time] [2022-07-12 11:21:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2022-07-12 11:21:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5348. [2022-07-12 11:21:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 3863 states have (on average 1.309086202433342) internal successors, (5057), 3945 states have internal predecessors, (5057), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-12 11:21:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7283 transitions. [2022-07-12 11:21:51,225 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7283 transitions. Word has length 210 [2022-07-12 11:21:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:51,225 INFO L495 AbstractCegarLoop]: Abstraction has 5348 states and 7283 transitions. [2022-07-12 11:21:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-12 11:21:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7283 transitions. [2022-07-12 11:21:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-12 11:21:51,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:51,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:51,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:21:51,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:21:51,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1868991143, now seen corresponding path program 1 times [2022-07-12 11:21:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724044531] [2022-07-12 11:21:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:21:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:21:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:21:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:21:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:21:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:21:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:21:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:21:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:21:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:21:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:21:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:21:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 11:21:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 11:21:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:21:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 11:21:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 11:21:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 11:21:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 11:21:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 11:21:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724044531] [2022-07-12 11:21:51,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724044531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:21:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925091622] [2022-07-12 11:21:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:51,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:21:51,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:21:51,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:21:51,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:21:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:52,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:21:52,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:21:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:21:52,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:21:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 11:21:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925091622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:21:52,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:21:52,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-12 11:21:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057576610] [2022-07-12 11:21:52,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:21:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:21:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:21:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:21:52,524 INFO L87 Difference]: Start difference. First operand 5348 states and 7283 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 11:21:58,598 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-12 11:22:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:00,446 INFO L93 Difference]: Finished difference Result 11457 states and 15862 transitions. [2022-07-12 11:22:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:22:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2022-07-12 11:22:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:00,468 INFO L225 Difference]: With dead ends: 11457 [2022-07-12 11:22:00,469 INFO L226 Difference]: Without dead ends: 6702 [2022-07-12 11:22:00,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:22:00,483 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 1265 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 6364 mSolverCounterSat, 873 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 7094 SdHoareTripleChecker+Invalid, 7238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 6364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:00,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 7094 Invalid, 7238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 6364 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-12 11:22:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-07-12 11:22:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 5409. [2022-07-12 11:22:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 3924 states have (on average 1.3093781855249744) internal successors, (5138), 4006 states have internal predecessors, (5138), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-12 11:22:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7364 transitions. [2022-07-12 11:22:00,750 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7364 transitions. Word has length 211 [2022-07-12 11:22:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:00,751 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7364 transitions. [2022-07-12 11:22:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 11:22:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7364 transitions. [2022-07-12 11:22:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-12 11:22:00,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:00,758 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:00,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:00,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:00,976 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1157276279, now seen corresponding path program 1 times [2022-07-12 11:22:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820976482] [2022-07-12 11:22:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:22:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:22:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:22:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:22:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:22:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:22:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:22:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 11:22:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 11:22:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:22:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 11:22:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 11:22:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:22:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 11:22:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 11:22:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:22:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820976482] [2022-07-12 11:22:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820976482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793126361] [2022-07-12 11:22:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:02,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:02,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:22:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 3340 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-12 11:22:02,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:02,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:02,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:02,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:02,976 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:22:02,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:22:03,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:22:03,404 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:22:03,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:22:03,502 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:22:03,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:22:03,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 11:22:04,673 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:22:04,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:22:04,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:04,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:05,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:22:06,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:22:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:06,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:06,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:06,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:22:07,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:22:07,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:22:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 11:22:07,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:08,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793126361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:08,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:08,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 53 [2022-07-12 11:22:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737976690] [2022-07-12 11:22:08,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 11:22:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:08,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 11:22:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3216, Unknown=11, NotChecked=0, Total=3540 [2022-07-12 11:22:08,816 INFO L87 Difference]: Start difference. First operand 5409 states and 7364 transitions. Second operand has 53 states, 52 states have (on average 5.269230769230769) internal successors, (274), 40 states have internal predecessors, (274), 16 states have call successors, (57), 12 states have call predecessors, (57), 19 states have return successors, (51), 23 states have call predecessors, (51), 14 states have call successors, (51)