./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:19:07,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:19:07,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:19:07,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:19:07,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:19:07,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:19:07,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:19:07,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:19:07,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:19:07,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:19:07,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:19:07,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:19:07,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:19:07,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:19:07,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:19:07,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:19:07,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:19:07,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:19:07,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:19:07,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:19:07,084 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:19:07,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:19:07,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:19:07,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:19:07,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:19:07,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:19:07,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:19:07,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:19:07,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:19:07,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:19:07,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:19:07,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:19:07,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:19:07,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:19:07,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:19:07,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:19:07,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:19:07,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:19:07,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:19:07,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:19:07,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:19:07,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:19:07,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:19:07,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:19:07,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:19:07,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:19:07,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:19:07,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:19:07,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:19:07,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:19:07,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:19:07,126 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:19:07,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:19:07,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:19:07,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:19:07,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:19:07,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:19:07,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:19:07,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:19:07,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:19:07,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:19:07,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:19:07,130 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 -> 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d [2022-07-12 12:19:07,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:19:07,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:19:07,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:19:07,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:19:07,329 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:19:07,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-12 12:19:07,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b869f37/8e4a8b277b3143b18e811b7f614675a4/FLAG6fb29ca85 [2022-07-12 12:19:08,108 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:19:08,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-12 12:19:08,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b869f37/8e4a8b277b3143b18e811b7f614675a4/FLAG6fb29ca85 [2022-07-12 12:19:08,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b869f37/8e4a8b277b3143b18e811b7f614675a4 [2022-07-12 12:19:08,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:19:08,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:19:08,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:19:08,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:19:08,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:19:08,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:19:08" (1/1) ... [2022-07-12 12:19:08,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1766c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:08, skipping insertion in model container [2022-07-12 12:19:08,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:19:08" (1/1) ... [2022-07-12 12:19:08,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:19:08,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:19:09,410 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.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-12 12:19:11,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:19:11,212 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:19:11,333 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.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-12 12:19:11,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:19:11,755 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:19:11,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11 WrapperNode [2022-07-12 12:19:11,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:19:11,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:19:11,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:19:11,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:19:11,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:11,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,200 INFO L137 Inliner]: procedures = 367, calls = 4074, calls flagged for inlining = 161, calls inlined = 138, statements flattened = 10019 [2022-07-12 12:19:12,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:19:12,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:19:12,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:19:12,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:19:12,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:19:12,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:19:12,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:19:12,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:19:12,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (1/1) ... [2022-07-12 12:19:12,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:19:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:19:12,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:19:12,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:19:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_free [2022-07-12 12:19:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_free [2022-07-12 12:19:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_mmap [2022-07-12 12:19:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_mmap [2022-07-12 12:19:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2022-07-12 12:19:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2022-07-12 12:19:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-12 12:19:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-12 12:19:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_compat_ioctl [2022-07-12 12:19:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_compat_ioctl [2022-07-12 12:19:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure remove_wait_queue [2022-07-12 12:19:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_wait_queue [2022-07-12 12:19:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 12:19:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-12 12:19:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-12 12:19:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:19:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:19:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_running [2022-07-12 12:19:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_running [2022-07-12 12:19:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_alloc [2022-07-12 12:19:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_alloc [2022-07-12 12:19:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure compat_chaninfo [2022-07-12 12:19:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_chaninfo [2022-07-12 12:19:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_cleanup [2022-07-12 12:19:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_cleanup [2022-07-12 12:19:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write_subdevice [2022-07-12 12:19:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write_subdevice [2022-07-12 12:19:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure max_write_buffer_kb_show [2022-07-12 12:19:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure max_write_buffer_kb_show [2022-07-12 12:19:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_set_subdevice_runflags [2022-07-12 12:19:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_set_subdevice_runflags [2022-07-12 12:19:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2022-07-12 12:19:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2022-07-12 12:19:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 12:19:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 12:19:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:19:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:19:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-12 12:19:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-12 12:19:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_read_subdevice [2022-07-12 12:19:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_read_subdevice [2022-07-12 12:19:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_free [2022-07-12 12:19:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_free [2022-07-12 12:19:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_open [2022-07-12 12:19:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_open [2022-07-12 12:19:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 12:19:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 12:19:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:19:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:19:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure compat_rangeinfo [2022-07-12 12:19:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_rangeinfo [2022-07-12 12:19:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insn [2022-07-12 12:19:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insn [2022-07-12 12:19:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insnlist [2022-07-12 12:19:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insnlist [2022-07-12 12:19:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_alloc [2022-07-12 12:19:12,934 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_alloc [2022-07-12 12:19:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2022-07-12 12:19:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_fasync [2022-07-12 12:19:12,934 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_fasync [2022-07-12 12:19:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:19:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:19:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure bytes_per_sample [2022-07-12 12:19:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure bytes_per_sample [2022-07-12 12:19:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-12 12:19:12,936 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-12 12:19:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:19:12,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:19:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_alloc_board_minor [2022-07-12 12:19:12,936 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_alloc_board_minor [2022-07-12 12:19:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 12:19:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 12:19:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_poll [2022-07-12 12:19:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_poll [2022-07-12 12:19:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_n_available [2022-07-12 12:19:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_n_available [2022-07-12 12:19:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-12 12:19:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-12 12:19:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-12 12:19:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-12 12:19:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-12 12:19:12,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-12 12:19:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_cmd [2022-07-12 12:19:12,938 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_cmd [2022-07-12 12:19:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:19:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:19:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 12:19:12,939 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 12:19:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 12:19:12,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 12:19:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_alloc [2022-07-12 12:19:12,939 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_alloc [2022-07-12 12:19:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-12 12:19:12,940 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-12 12:19:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 12:19:12,940 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 12:19:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_in_error [2022-07-12 12:19:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_in_error [2022-07-12 12:19:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_detach [2022-07-12 12:19:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_detach [2022-07-12 12:19:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_check_chanlist [2022-07-12 12:19:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_check_chanlist [2022-07-12 12:19:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:19:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:19:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 12:19:12,942 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 12:19:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write [2022-07-12 12:19:12,942 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write [2022-07-12 12:19:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 12:19:12,942 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 12:19:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-12 12:19:12,943 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-12 12:19:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:19:12,943 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:19:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_proc_open [2022-07-12 12:19:12,943 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_proc_open [2022-07-12 12:19:12,944 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2022-07-12 12:19:12,945 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2022-07-12 12:19:12,945 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:19:12,945 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:19:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 12:19:12,947 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 12:19:12,947 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 12:19:12,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 12:19:12,947 INFO L130 BoogieDeclarations]: Found specification of procedure add_wait_queue [2022-07-12 12:19:12,948 INFO L138 BoogieDeclarations]: Found implementation of procedure add_wait_queue [2022-07-12 12:19:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-12 12:19:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-12 12:19:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:19:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:19:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 12:19:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 12:19:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_postconfig [2022-07-12 12:19:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_postconfig [2022-07-12 12:19:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 12:19:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 12:19:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure max_read_buffer_kb_show [2022-07-12 12:19:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure max_read_buffer_kb_show [2022-07-12 12:19:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 12:19:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 12:19:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_free_board_dev [2022-07-12 12:19:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_free_board_dev [2022-07-12 12:19:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_free [2022-07-12 12:19:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_free [2022-07-12 12:19:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_dev_from_minor [2022-07-12 12:19:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_dev_from_minor [2022-07-12 12:19:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:19:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure compat_alloc_user_space [2022-07-12 12:19:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_alloc_user_space [2022-07-12 12:19:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_cleanup_board_minors [2022-07-12 12:19:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_cleanup_board_minors [2022-07-12 12:19:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-12 12:19:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-12 12:19:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_close [2022-07-12 12:19:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_close [2022-07-12 12:19:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_write_alloc [2022-07-12 12:19:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_write_alloc [2022-07-12 12:19:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write_buffer_kb_show [2022-07-12 12:19:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure write_buffer_kb_show [2022-07-12 12:19:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmd [2022-07-12 12:19:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmd [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:19:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-12 12:19:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 12:19:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 12:19:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2022-07-12 12:19:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2022-07-12 12:19:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:19:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:19:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_subdevice_from_minor [2022-07-12 12:19:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_subdevice_from_minor [2022-07-12 12:19:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmdtest [2022-07-12 12:19:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmdtest [2022-07-12 12:19:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read_buffer_kb_show [2022-07-12 12:19:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure read_buffer_kb_show [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2022-07-12 12:19:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure insn_rw_emulate_bits [2022-07-12 12:19:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure insn_rw_emulate_bits [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 12:19:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 12:19:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:19:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_n_allocated [2022-07-12 12:19:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_n_allocated [2022-07-12 12:19:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_close [2022-07-12 12:19:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_close [2022-07-12 12:19:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:19:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_open [2022-07-12 12:19:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_open [2022-07-12 12:19:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 12:19:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:19:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:19:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_idle [2022-07-12 12:19:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_idle [2022-07-12 12:19:12,960 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-12 12:19:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-12 12:19:12,960 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 12:19:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 12:19:12,960 INFO L130 BoogieDeclarations]: Found specification of procedure translated_ioctl [2022-07-12 12:19:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure translated_ioctl [2022-07-12 12:19:12,960 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-12 12:19:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-12 12:19:12,960 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-12 12:19:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure raw_ioctl [2022-07-12 12:19:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_ioctl [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_reset [2022-07-12 12:19:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_reset [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure resize_async_buffer [2022-07-12 12:19:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure resize_async_buffer [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure parse_insn [2022-07-12 12:19:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_insn [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_get_subdevice_runflags [2022-07-12 12:19:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_get_subdevice_runflags [2022-07-12 12:19:12,961 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:19:12,962 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-12 12:19:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-12 12:19:12,962 INFO L130 BoogieDeclarations]: Found specification of procedure do_become_nonbusy [2022-07-12 12:19:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure do_become_nonbusy [2022-07-12 12:19:12,962 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_unlocked_ioctl [2022-07-12 12:19:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_unlocked_ioctl [2022-07-12 12:19:12,962 INFO L130 BoogieDeclarations]: Found specification of procedure do_cancel [2022-07-12 12:19:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure do_cancel [2022-07-12 12:19:12,962 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_insn [2022-07-12 12:19:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_insn [2022-07-12 12:19:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:19:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtouint [2022-07-12 12:19:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtouint [2022-07-12 12:19:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:19:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:19:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 12:19:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 12:19:14,010 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:19:14,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:19:14,420 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:19:16,513 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume 0 != aref_invalid_~tmp~66#1;havoc aref_invalid_#t~nondet1322#1; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume !(0 != aref_invalid_~tmp~66#1); [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9037: aref_invalid_#res#1 := 1;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !(0 == aref_invalid_~chanspec#1 / 16777216); [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1318#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 3 == aref_invalid_~aref~0#1; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume 0 == aref_invalid_~chanspec#1 / 16777216;aref_invalid_~aref~0#1 := 0; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume 0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576)));havoc aref_invalid_#t~mem1318#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume !(0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576))));havoc aref_invalid_#t~mem1318#1; [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1317#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-12 12:19:16,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 0 == aref_invalid_~aref~0#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume false;aref_invalid_~aref~0#1 := aref_invalid_~chanspec#1 / 16777216; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume !false; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume aref_invalid_~chanspec#1 / 16777216 >= 0;abs_9007 := (if aref_invalid_~chanspec#1 / 16777216 < 3 then aref_invalid_~chanspec#1 / 16777216 else 3);assume aref_invalid_~chanspec#1 / 16777216 >= 0;assume aref_invalid_~aref~0#1 < abs_9007; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume !(aref_invalid_~chanspec#1 / 16777216 >= 0);aref_invalid_~aref~0#1 := aref_invalid_#t~nondet1314#1;havoc aref_invalid_#t~nondet1314#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume false;aref_invalid_~aref~0#1 := 3; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume !false; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-6: aref_invalid_#t~switch1315#1 := 2 == aref_invalid_~aref~0#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume 0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152)));havoc aref_invalid_#t~mem1317#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume !(0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152))));havoc aref_invalid_#t~mem1317#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9008: havoc aref_invalid_#t~switch1315#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume aref_invalid_#t~switch1315#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume !aref_invalid_#t~switch1315#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1316#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 1 == aref_invalid_~aref~0#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume 0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304)));havoc aref_invalid_#t~mem1316#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume !(0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304))));havoc aref_invalid_#t~mem1316#1; [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1319#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-12 12:19:16,673 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := true; [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: SUMMARY for call aref_invalid_#t~ret1321#1 := ldv__builtin_expect(aref_invalid_#t~mem1320#1 % 256, 0); srcloc: null [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044-1: assume -9223372036854775808 <= aref_invalid_#t~ret1321#1 && aref_invalid_#t~ret1321#1 <= 9223372036854775807;aref_invalid_~tmp~66#1 := aref_invalid_#t~ret1321#1;havoc aref_invalid_#t~mem1320#1;havoc aref_invalid_#t~ret1321#1; [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume 0 != ~comedi_debug~0;call write~$Pointer$(302, 0, aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(303, 0, aref_invalid_~#descriptor~14#1.base, 8 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(304, 0, aref_invalid_~#descriptor~14#1.base, 16 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(305, 0, aref_invalid_~#descriptor~14#1.base, 24 + aref_invalid_~#descriptor~14#1.offset, 8);call write~int(168, aref_invalid_~#descriptor~14#1.base, 32 + aref_invalid_~#descriptor~14#1.offset, 4);call write~int(0, aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1);call aref_invalid_#t~mem1320#1 := read~int(aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1); [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume !(0 != ~comedi_debug~0); [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume 0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608)));havoc aref_invalid_#t~mem1319#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-12 12:19:16,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume !(0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608))));havoc aref_invalid_#t~mem1319#1; [2022-07-12 12:19:24,992 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:19:25,019 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:19:25,019 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:19:25,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:19:25 BoogieIcfgContainer [2022-07-12 12:19:25,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:19:25,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:19:25,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:19:25,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:19:25,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:19:08" (1/3) ... [2022-07-12 12:19:25,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d9c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:19:25, skipping insertion in model container [2022-07-12 12:19:25,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:19:11" (2/3) ... [2022-07-12 12:19:25,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d9c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:19:25, skipping insertion in model container [2022-07-12 12:19:25,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:19:25" (3/3) ... [2022-07-12 12:19:25,031 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-12 12:19:25,041 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:19:25,041 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:19:25,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:19:25,204 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@3da89096, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d09b28a [2022-07-12 12:19:25,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:19:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) [2022-07-12 12:19:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 12:19:25,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:19:25,254 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:19:25,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:19:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:19:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -113660622, now seen corresponding path program 1 times [2022-07-12 12:19:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:19:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558815056] [2022-07-12 12:19:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:19:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:19:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:19:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:19:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:19:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:19:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:19:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:19:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:19:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:19:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:19:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:19:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:19:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:19:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:19:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:19:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:19:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:19:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558815056] [2022-07-12 12:19:26,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558815056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:19:26,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:19:26,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:19:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769183089] [2022-07-12 12:19:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:19:26,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:19:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:19:26,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:19:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:19:26,057 INFO L87 Difference]: Start difference. First operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 12:19:30,480 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 12:19:34,590 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 12:19:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:19:34,803 INFO L93 Difference]: Finished difference Result 7835 states and 12526 transitions. [2022-07-12 12:19:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:19:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2022-07-12 12:19:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:19:34,847 INFO L225 Difference]: With dead ends: 7835 [2022-07-12 12:19:34,847 INFO L226 Difference]: Without dead ends: 4002 [2022-07-12 12:19:34,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:19:34,870 INFO L413 NwaCegarLoop]: 5817 mSDtfsCounter, 6299 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 980 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6700 SdHoareTripleChecker+Valid, 9408 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:19:34,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6700 Valid, 9408 Invalid, 2343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [980 Valid, 1361 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2022-07-12 12:19:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-12 12:19:35,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3788. [2022-07-12 12:19:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3085 states have (on average 1.5319286871961102) internal successors, (4726), 3097 states have internal predecessors, (4726), 591 states have call successors, (591), 112 states have call predecessors, (591), 111 states have return successors, (589), 588 states have call predecessors, (589), 589 states have call successors, (589) [2022-07-12 12:19:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5906 transitions. [2022-07-12 12:19:35,049 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5906 transitions. Word has length 106 [2022-07-12 12:19:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:19:35,052 INFO L495 AbstractCegarLoop]: Abstraction has 3788 states and 5906 transitions. [2022-07-12 12:19:35,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 12:19:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5906 transitions. [2022-07-12 12:19:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 12:19:35,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:19:35,056 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:19:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:19:35,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:19:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:19:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 249698647, now seen corresponding path program 1 times [2022-07-12 12:19:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:19:35,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057839256] [2022-07-12 12:19:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:19:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:19:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:19:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:19:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:19:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:19:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:19:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:19:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:19:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:19:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:19:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:19:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:19:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:19:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:19:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:19:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:19:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:19:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057839256] [2022-07-12 12:19:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057839256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:19:35,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:19:35,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:19:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833317471] [2022-07-12 12:19:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:19:35,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:19:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:19:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:19:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:19:35,502 INFO L87 Difference]: Start difference. First operand 3788 states and 5906 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 12:19:40,071 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 12:19:44,987 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 12:19:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:19:46,912 INFO L93 Difference]: Finished difference Result 11728 states and 18438 transitions. [2022-07-12 12:19:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:19:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2022-07-12 12:19:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:19:46,948 INFO L225 Difference]: With dead ends: 11728 [2022-07-12 12:19:46,948 INFO L226 Difference]: Without dead ends: 7949 [2022-07-12 12:19:46,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:19:46,962 INFO L413 NwaCegarLoop]: 6355 mSDtfsCounter, 7007 mSDsluCounter, 8633 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 1607 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7465 SdHoareTripleChecker+Valid, 14988 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:19:46,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7465 Valid, 14988 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 2948 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-07-12 12:19:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2022-07-12 12:19:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7578. [2022-07-12 12:19:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 6181 states have (on average 1.5337324057595858) internal successors, (9480), 6205 states have internal predecessors, (9480), 1165 states have call successors, (1165), 223 states have call predecessors, (1165), 231 states have return successors, (1229), 1169 states have call predecessors, (1229), 1162 states have call successors, (1229) [2022-07-12 12:19:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11874 transitions. [2022-07-12 12:19:47,154 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11874 transitions. Word has length 108 [2022-07-12 12:19:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:19:47,155 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 11874 transitions. [2022-07-12 12:19:47,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 12:19:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11874 transitions. [2022-07-12 12:19:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 12:19:47,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:19:47,164 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-07-12 12:19:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:19:47,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:19:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:19:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1851708862, now seen corresponding path program 1 times [2022-07-12 12:19:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:19:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14358717] [2022-07-12 12:19:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:19:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:19:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:19:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:19:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:19:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:19:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:19:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:19:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:19:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:19:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:19:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:19:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:19:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:19:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:19:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:19:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 12:19:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:19:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:19:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:19:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:19:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 12:19:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-12 12:19:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:19:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14358717] [2022-07-12 12:19:47,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14358717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:19:47,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:19:47,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:19:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640919082] [2022-07-12 12:19:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:19:47,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:19:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:19:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:19:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:19:47,455 INFO L87 Difference]: Start difference. First operand 7578 states and 11874 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:19:52,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:19:56,852 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 12:19:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:19:57,021 INFO L93 Difference]: Finished difference Result 16967 states and 26412 transitions. [2022-07-12 12:19:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:19:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2022-07-12 12:19:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:19:57,115 INFO L225 Difference]: With dead ends: 16967 [2022-07-12 12:19:57,131 INFO L226 Difference]: Without dead ends: 9416 [2022-07-12 12:19:57,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:19:57,194 INFO L413 NwaCegarLoop]: 5970 mSDtfsCounter, 1942 mSDsluCounter, 8491 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 886 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 14461 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:19:57,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 14461 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 2521 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-07-12 12:19:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2022-07-12 12:19:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 8930. [2022-07-12 12:19:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 7210 states have (on average 1.510124826629681) internal successors, (10888), 7241 states have internal predecessors, (10888), 1416 states have call successors, (1416), 296 states have call predecessors, (1416), 303 states have return successors, (1479), 1416 states have call predecessors, (1479), 1412 states have call successors, (1479) [2022-07-12 12:19:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13783 transitions. [2022-07-12 12:19:57,412 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13783 transitions. Word has length 151 [2022-07-12 12:19:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:19:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 8930 states and 13783 transitions. [2022-07-12 12:19:57,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:19:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13783 transitions. [2022-07-12 12:19:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 12:19:57,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:19:57,418 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:19:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:19:57,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:19:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:19:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 769983256, now seen corresponding path program 1 times [2022-07-12 12:19:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:19:57,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790539661] [2022-07-12 12:19:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:19:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:19:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:19:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:19:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:19:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:19:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:19:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:19:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:19:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:19:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:19:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:19:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:19:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:19:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:19:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:19:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:19:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:19:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:19:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:19:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:19:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:19:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:19:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-12 12:19:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:19:57,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790539661] [2022-07-12 12:19:57,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790539661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:19:57,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:19:57,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:19:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066872263] [2022-07-12 12:19:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:19:57,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:19:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:19:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:19:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:19:57,702 INFO L87 Difference]: Start difference. First operand 8930 states and 13783 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:20:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:20:03,669 INFO L93 Difference]: Finished difference Result 27721 states and 42979 transitions. [2022-07-12 12:20:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:20:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2022-07-12 12:20:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:20:03,766 INFO L225 Difference]: With dead ends: 27721 [2022-07-12 12:20:03,767 INFO L226 Difference]: Without dead ends: 18816 [2022-07-12 12:20:03,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:20:03,804 INFO L413 NwaCegarLoop]: 6204 mSDtfsCounter, 10427 mSDsluCounter, 8664 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 4561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10956 SdHoareTripleChecker+Valid, 14868 SdHoareTripleChecker+Invalid, 7597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4561 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:20:03,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10956 Valid, 14868 Invalid, 7597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4561 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 12:20:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2022-07-12 12:20:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 17319. [2022-07-12 12:20:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17319 states, 14066 states have (on average 1.5177733541874023) internal successors, (21349), 14119 states have internal predecessors, (21349), 2672 states have call successors, (2672), 561 states have call predecessors, (2672), 580 states have return successors, (2819), 2682 states have call predecessors, (2819), 2668 states have call successors, (2819) [2022-07-12 12:20:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 26840 transitions. [2022-07-12 12:20:04,412 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 26840 transitions. Word has length 157 [2022-07-12 12:20:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:20:04,413 INFO L495 AbstractCegarLoop]: Abstraction has 17319 states and 26840 transitions. [2022-07-12 12:20:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:20:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 26840 transitions. [2022-07-12 12:20:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 12:20:04,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:20:04,421 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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] [2022-07-12 12:20:04,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:20:04,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:20:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:20:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -937695385, now seen corresponding path program 1 times [2022-07-12 12:20:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:20:04,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451473640] [2022-07-12 12:20:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:20:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:20:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:20:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:20:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:20:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:20:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:20:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:20:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:20:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:20:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:20:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:20:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:20:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:20:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:20:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:20:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:20:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:20:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 12:20:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:20:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:20:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-07-12 12:20:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:20:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451473640] [2022-07-12 12:20:04,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451473640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:20:04,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:20:04,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:20:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920326945] [2022-07-12 12:20:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:20:04,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:20:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:20:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:20:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:20:04,716 INFO L87 Difference]: Start difference. First operand 17319 states and 26840 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:20:09,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:20:13,318 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 12:20:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:20:13,699 INFO L93 Difference]: Finished difference Result 28028 states and 43168 transitions. [2022-07-12 12:20:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:20:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2022-07-12 12:20:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:20:13,731 INFO L225 Difference]: With dead ends: 28028 [2022-07-12 12:20:13,731 INFO L226 Difference]: Without dead ends: 10740 [2022-07-12 12:20:13,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:20:13,757 INFO L413 NwaCegarLoop]: 5750 mSDtfsCounter, 6315 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 983 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 9323 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:20:13,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 9323 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1352 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-07-12 12:20:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2022-07-12 12:20:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10086. [2022-07-12 12:20:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10086 states, 8081 states have (on average 1.4892958792228685) internal successors, (12035), 8117 states have internal predecessors, (12035), 1620 states have call successors, (1620), 376 states have call predecessors, (1620), 384 states have return successors, (1690), 1620 states have call predecessors, (1690), 1616 states have call successors, (1690) [2022-07-12 12:20:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 15345 transitions. [2022-07-12 12:20:14,005 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 15345 transitions. Word has length 191 [2022-07-12 12:20:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:20:14,006 INFO L495 AbstractCegarLoop]: Abstraction has 10086 states and 15345 transitions. [2022-07-12 12:20:14,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:20:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 15345 transitions. [2022-07-12 12:20:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-12 12:20:14,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:20:14,014 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2022-07-12 12:20:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:20:14,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:20:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:20:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1170401307, now seen corresponding path program 1 times [2022-07-12 12:20:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:20:14,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953915818] [2022-07-12 12:20:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:20:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:20:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:20:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:20:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:20:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:20:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:20:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:20:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:20:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:20:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:20:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:20:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:20:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:20:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:20:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:20:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:20:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:20:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:20:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:20:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:20:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 12:20:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 12:20:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:20:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 12:20:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 12:20:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 12:20:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-12 12:20:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:20:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-07-12 12:20:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:20:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953915818] [2022-07-12 12:20:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953915818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:20:14,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:20:14,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:20:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347954093] [2022-07-12 12:20:14,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:20:14,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:20:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:20:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:20:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:20:14,359 INFO L87 Difference]: Start difference. First operand 10086 states and 15345 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:20:22,261 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 12:20:24,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:20:31,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:20:33,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:20:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:20:34,296 INFO L93 Difference]: Finished difference Result 20724 states and 31634 transitions. [2022-07-12 12:20:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:20:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2022-07-12 12:20:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:20:34,332 INFO L225 Difference]: With dead ends: 20724 [2022-07-12 12:20:34,332 INFO L226 Difference]: Without dead ends: 11190 [2022-07-12 12:20:34,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:20:34,353 INFO L413 NwaCegarLoop]: 5717 mSDtfsCounter, 1012 mSDsluCounter, 18908 mSDsCounter, 0 mSdLazyCounter, 7440 mSolverCounterSat, 690 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 24625 SdHoareTripleChecker+Invalid, 8134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 7440 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:20:34,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 24625 Invalid, 8134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 7440 Invalid, 4 Unknown, 0 Unchecked, 19.5s Time] [2022-07-12 12:20:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2022-07-12 12:20:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10077. [2022-07-12 12:20:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10077 states, 8074 states have (on average 1.4892246717859796) internal successors, (12024), 8110 states have internal predecessors, (12024), 1619 states have call successors, (1619), 375 states have call predecessors, (1619), 383 states have return successors, (1689), 1619 states have call predecessors, (1689), 1615 states have call successors, (1689) [2022-07-12 12:20:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 15332 transitions. [2022-07-12 12:20:34,592 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 15332 transitions. Word has length 234 [2022-07-12 12:20:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:20:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 10077 states and 15332 transitions. [2022-07-12 12:20:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:20:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 15332 transitions. [2022-07-12 12:20:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-12 12:20:34,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:20:34,598 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:20:34,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:20:34,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:20:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:20:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash 169165785, now seen corresponding path program 1 times [2022-07-12 12:20:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:20:34,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975004743] [2022-07-12 12:20:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:20:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:20:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:20:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:20:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:20:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:20:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:20:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:20:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:20:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:20:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:20:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:20:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:20:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:20:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:20:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:20:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:20:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:20:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:20:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 12:20:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:20:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:20:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:20:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 12:20:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 12:20:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 12:20:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:20:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:20:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-07-12 12:20:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:20:34,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975004743] [2022-07-12 12:20:34,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975004743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:20:34,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:20:34,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:20:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788652045] [2022-07-12 12:20:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:20:34,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:20:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:20:34,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:20:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:20:34,991 INFO L87 Difference]: Start difference. First operand 10077 states and 15332 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 12:20:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:20:40,517 INFO L93 Difference]: Finished difference Result 20201 states and 31043 transitions. [2022-07-12 12:20:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:20:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 249 [2022-07-12 12:20:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:20:40,590 INFO L225 Difference]: With dead ends: 20201 [2022-07-12 12:20:40,591 INFO L226 Difference]: Without dead ends: 10685 [2022-07-12 12:20:40,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:20:40,614 INFO L413 NwaCegarLoop]: 5835 mSDtfsCounter, 8413 mSDsluCounter, 12170 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 2726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8907 SdHoareTripleChecker+Valid, 18005 SdHoareTripleChecker+Invalid, 6626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2726 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:20:40,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8907 Valid, 18005 Invalid, 6626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2726 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-12 12:20:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-07-12 12:20:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 9427. [2022-07-12 12:20:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 7607 states have (on average 1.5028263441566978) internal successors, (11432), 7638 states have internal predecessors, (11432), 1483 states have call successors, (1483), 327 states have call predecessors, (1483), 336 states have return successors, (1556), 1485 states have call predecessors, (1556), 1479 states have call successors, (1556) [2022-07-12 12:20:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14471 transitions. [2022-07-12 12:20:40,863 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14471 transitions. Word has length 249 [2022-07-12 12:20:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:20:40,864 INFO L495 AbstractCegarLoop]: Abstraction has 9427 states and 14471 transitions. [2022-07-12 12:20:40,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 12:20:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14471 transitions. [2022-07-12 12:20:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-12 12:20:40,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:20:40,873 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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] [2022-07-12 12:20:40,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:20:40,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:20:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:20:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1271706461, now seen corresponding path program 1 times [2022-07-12 12:20:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:20:40,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743609558] [2022-07-12 12:20:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:20:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:20:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:20:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:20:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:20:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:20:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:20:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:20:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:20:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:20:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:20:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:20:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:20:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:20:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:20:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:20:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:20:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:20:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:20:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:20:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:20:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:20:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:20:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:20:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:20:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:20:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:20:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:20:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 12:20:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 12:20:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:20:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 12:20:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-07-12 12:20:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:20:41,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743609558] [2022-07-12 12:20:41,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743609558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:20:41,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:20:41,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:20:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223454359] [2022-07-12 12:20:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:20:41,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:20:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:20:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:20:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:20:41,312 INFO L87 Difference]: Start difference. First operand 9427 states and 14471 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:20:51,876 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 12:20:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:20:52,353 INFO L93 Difference]: Finished difference Result 21600 states and 32975 transitions. [2022-07-12 12:20:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:20:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 273 [2022-07-12 12:20:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:20:52,400 INFO L225 Difference]: With dead ends: 21600 [2022-07-12 12:20:52,400 INFO L226 Difference]: Without dead ends: 12734 [2022-07-12 12:20:52,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:20:52,425 INFO L413 NwaCegarLoop]: 6506 mSDtfsCounter, 2618 mSDsluCounter, 12798 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 1136 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 19304 SdHoareTripleChecker+Invalid, 4919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:20:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 19304 Invalid, 4919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 3782 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2022-07-12 12:20:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2022-07-12 12:20:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 11694. [2022-07-12 12:20:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11694 states, 9306 states have (on average 1.478508489146787) internal successors, (13759), 9348 states have internal predecessors, (13759), 1913 states have call successors, (1913), 465 states have call predecessors, (1913), 474 states have return successors, (1987), 1912 states have call predecessors, (1987), 1908 states have call successors, (1987) [2022-07-12 12:20:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17659 transitions. [2022-07-12 12:20:52,733 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17659 transitions. Word has length 273 [2022-07-12 12:20:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:20:52,734 INFO L495 AbstractCegarLoop]: Abstraction has 11694 states and 17659 transitions. [2022-07-12 12:20:52,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 12:20:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17659 transitions. [2022-07-12 12:20:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-12 12:20:52,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:20:52,742 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1] [2022-07-12 12:20:52,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:20:52,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:20:52,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:20:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash 78876558, now seen corresponding path program 1 times [2022-07-12 12:20:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:20:52,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025697782] [2022-07-12 12:20:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:20:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:20:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:20:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:20:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:20:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:20:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:20:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:20:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:20:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:20:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:20:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:20:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:20:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:20:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:20:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:20:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:20:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:20:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:20:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:20:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:20:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:20:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:20:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:20:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:20:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:20:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:20:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:20:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:20:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:20:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 12:20:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:20:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:20:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:20:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:20:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:20:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-12 12:20:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:20:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025697782] [2022-07-12 12:20:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025697782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:20:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:20:53,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:20:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126616387] [2022-07-12 12:20:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:20:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:20:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:20:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:20:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:20:53,242 INFO L87 Difference]: Start difference. First operand 11694 states and 17659 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:21:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:03,086 INFO L93 Difference]: Finished difference Result 18810 states and 28593 transitions. [2022-07-12 12:21:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:21:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 277 [2022-07-12 12:21:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:03,217 INFO L225 Difference]: With dead ends: 18810 [2022-07-12 12:21:03,231 INFO L226 Difference]: Without dead ends: 18807 [2022-07-12 12:21:03,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:21:03,248 INFO L413 NwaCegarLoop]: 11784 mSDtfsCounter, 15925 mSDsluCounter, 16674 mSDsCounter, 0 mSdLazyCounter, 7150 mSolverCounterSat, 5001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16766 SdHoareTripleChecker+Valid, 28458 SdHoareTripleChecker+Invalid, 12151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5001 IncrementalHoareTripleChecker+Valid, 7150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:03,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16766 Valid, 28458 Invalid, 12151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5001 Valid, 7150 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-12 12:21:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2022-07-12 12:21:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17370. [2022-07-12 12:21:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17370 states, 13821 states have (on average 1.4789089067361263) internal successors, (20440), 13890 states have internal predecessors, (20440), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-12 12:21:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 26346 transitions. [2022-07-12 12:21:04,245 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 26346 transitions. Word has length 277 [2022-07-12 12:21:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:04,263 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 26346 transitions. [2022-07-12 12:21:04,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:21:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 26346 transitions. [2022-07-12 12:21:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-12 12:21:04,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:04,272 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1] [2022-07-12 12:21:04,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:21:04,272 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1509471344, now seen corresponding path program 1 times [2022-07-12 12:21:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:04,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370219021] [2022-07-12 12:21:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:04,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:21:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:21:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:21:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:21:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:21:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:21:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:21:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:21:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:21:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:21:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:21:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:21:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:21:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:21:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:21:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:21:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:21:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:21:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:21:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:21:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:21:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:21:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:21:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:21:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:21:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:21:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:21:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:21:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:05,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 12:21:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:21:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:21:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2022-07-12 12:21:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370219021] [2022-07-12 12:21:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370219021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:21:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734709050] [2022-07-12 12:21:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:21:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:21:06,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:21:06,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:21:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:07,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 4904 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 12:21:07,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:21:07,901 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 22 treesize of output 10 [2022-07-12 12:21:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-12 12:21:07,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:21:07,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734709050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:07,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:21:07,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-12 12:21:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732317467] [2022-07-12 12:21:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:07,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:21:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:21:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2022-07-12 12:21:07,998 INFO L87 Difference]: Start difference. First operand 17370 states and 26346 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 12:21:13,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:18,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:20,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:20,236 INFO L93 Difference]: Finished difference Result 34371 states and 52374 transitions. [2022-07-12 12:21:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:21:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 277 [2022-07-12 12:21:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:20,300 INFO L225 Difference]: With dead ends: 34371 [2022-07-12 12:21:20,301 INFO L226 Difference]: Without dead ends: 17562 [2022-07-12 12:21:20,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-12 12:21:20,341 INFO L413 NwaCegarLoop]: 5818 mSDtfsCounter, 26 mSDsluCounter, 16529 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22347 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:20,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22347 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2022-07-12 12:21:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2022-07-12 12:21:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 17400. [2022-07-12 12:21:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17400 states, 13851 states have (on average 1.4783048155367844) internal successors, (20476), 13920 states have internal predecessors, (20476), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-12 12:21:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 26382 transitions. [2022-07-12 12:21:20,964 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 26382 transitions. Word has length 277 [2022-07-12 12:21:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:20,965 INFO L495 AbstractCegarLoop]: Abstraction has 17400 states and 26382 transitions. [2022-07-12 12:21:20,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 12:21:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 26382 transitions. [2022-07-12 12:21:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 12:21:20,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:20,972 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1] [2022-07-12 12:21:21,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 12:21:21,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 12:21:21,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash -459269918, now seen corresponding path program 1 times [2022-07-12 12:21:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131020320] [2022-07-12 12:21:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:21:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:21:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:21:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:21:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:21:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:21:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:21:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:21:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:21:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:21:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:21:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:21:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:21:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:21:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:21:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:21:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:21:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:21:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:21:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:21:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:21:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:21:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:21:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:21:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:21:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:21:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:21:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:21:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 12:21:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:21:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:21:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-12 12:21:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-12 12:21:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131020320] [2022-07-12 12:21:21,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131020320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:21,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:21,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:21:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467052517] [2022-07-12 12:21:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:21,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:21:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:21,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:21:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:21:21,493 INFO L87 Difference]: Start difference. First operand 17400 states and 26382 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-12 12:21:29,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:38,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:21:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:21:39,013 INFO L93 Difference]: Finished difference Result 37107 states and 56836 transitions. [2022-07-12 12:21:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:21:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 279 [2022-07-12 12:21:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:21:39,113 INFO L225 Difference]: With dead ends: 37107 [2022-07-12 12:21:39,113 INFO L226 Difference]: Without dead ends: 20268 [2022-07-12 12:21:39,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:21:39,149 INFO L413 NwaCegarLoop]: 5398 mSDtfsCounter, 5489 mSDsluCounter, 8512 mSDsCounter, 0 mSdLazyCounter, 9006 mSolverCounterSat, 1760 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 10768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1760 IncrementalHoareTripleChecker+Valid, 9006 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:21:39,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 13910 Invalid, 10768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1760 Valid, 9006 Invalid, 2 Unknown, 0 Unchecked, 16.8s Time] [2022-07-12 12:21:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2022-07-12 12:21:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 18512. [2022-07-12 12:21:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18512 states, 14843 states have (on average 1.4852118843899482) internal successors, (22045), 14902 states have internal predecessors, (22045), 2931 states have call successors, (2931), 682 states have call predecessors, (2931), 737 states have return successors, (3270), 2975 states have call predecessors, (3270), 2926 states have call successors, (3270) [2022-07-12 12:21:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 28246 transitions. [2022-07-12 12:21:39,802 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 28246 transitions. Word has length 279 [2022-07-12 12:21:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:21:39,803 INFO L495 AbstractCegarLoop]: Abstraction has 18512 states and 28246 transitions. [2022-07-12 12:21:39,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-12 12:21:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 28246 transitions. [2022-07-12 12:21:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 12:21:39,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:21:39,810 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1] [2022-07-12 12:21:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:21:39,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:21:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:21:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1268616544, now seen corresponding path program 1 times [2022-07-12 12:21:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:21:39,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188995465] [2022-07-12 12:21:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:21:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:21:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:21:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:21:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:21:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:21:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:21:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:21:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:21:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:21:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:21:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:21:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:21:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:21:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:21:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:21:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:21:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:21:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:21:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:21:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:21:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:21:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:21:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:21:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:21:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:21:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:21:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:21:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:21:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:21:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 12:21:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:21:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:21:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:21:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:21:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-12 12:21:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:21:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-12 12:21:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:21:40,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188995465] [2022-07-12 12:21:40,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188995465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:21:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:21:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:21:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609466583] [2022-07-12 12:21:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:21:40,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:21:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:21:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:21:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:21:40,199 INFO L87 Difference]: Start difference. First operand 18512 states and 28246 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:21:56,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:22:06,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:22:22,025 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 12:22:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:22:26,204 INFO L93 Difference]: Finished difference Result 51859 states and 80071 transitions. [2022-07-12 12:22:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 12:22:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 279 [2022-07-12 12:22:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:22:26,342 INFO L225 Difference]: With dead ends: 51859 [2022-07-12 12:22:26,342 INFO L226 Difference]: Without dead ends: 39401 [2022-07-12 12:22:26,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-12 12:22:26,384 INFO L413 NwaCegarLoop]: 10809 mSDtfsCounter, 11318 mSDsluCounter, 37030 mSDsCounter, 0 mSdLazyCounter, 40146 mSolverCounterSat, 3630 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11848 SdHoareTripleChecker+Valid, 47839 SdHoareTripleChecker+Invalid, 43778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3630 IncrementalHoareTripleChecker+Valid, 40146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:22:26,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11848 Valid, 47839 Invalid, 43778 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3630 Valid, 40146 Invalid, 2 Unknown, 0 Unchecked, 44.5s Time] [2022-07-12 12:22:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-07-12 12:22:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 36439. [2022-07-12 12:22:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36439 states, 29238 states have (on average 1.4873452356522334) internal successors, (43487), 29355 states have internal predecessors, (43487), 5721 states have call successors, (5721), 1338 states have call predecessors, (5721), 1479 states have return successors, (6732), 5841 states have call predecessors, (6732), 5713 states have call successors, (6732) [2022-07-12 12:22:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 55940 transitions. [2022-07-12 12:22:27,746 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 55940 transitions. Word has length 279 [2022-07-12 12:22:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:22:27,747 INFO L495 AbstractCegarLoop]: Abstraction has 36439 states and 55940 transitions. [2022-07-12 12:22:27,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:22:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 55940 transitions. [2022-07-12 12:22:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 12:22:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:22:27,758 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:22:27,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:22:27,758 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:22:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:22:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 634260467, now seen corresponding path program 1 times [2022-07-12 12:22:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:22:27,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649014234] [2022-07-12 12:22:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:22:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:22:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:22:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:22:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:22:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:22:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:22:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:22:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:22:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:22:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:22:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:22:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:22:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:22:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:22:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:22:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:22:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:22:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:22:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:22:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:22:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 12:22:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:22:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:22:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:22:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 12:22:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:22:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:22:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 12:22:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 12:22:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:22:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 12:22:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-12 12:22:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 12:22:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 12:22:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:22:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2022-07-12 12:22:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:22:28,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649014234] [2022-07-12 12:22:28,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649014234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:22:28,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137129632] [2022-07-12 12:22:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:22:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:22:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:22:28,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:22:28,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:22:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:22:30,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 12:22:30,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:22:30,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,077 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:22:30,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-12 12:22:30,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,097 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:22:30,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-12 12:22:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,893 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 13 treesize of output 15 [2022-07-12 12:22:30,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:30,902 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 13 treesize of output 15 [2022-07-12 12:22:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:31,301 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 20 treesize of output 20 [2022-07-12 12:22:31,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:22:31,305 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 20 treesize of output 20 [2022-07-12 12:22:33,660 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 27 treesize of output 21 [2022-07-12 12:22:33,662 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 20 treesize of output 16 [2022-07-12 12:22:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 3 proven. 591 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-07-12 12:22:33,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:22:44,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137129632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:22:44,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:22:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 24 [2022-07-12 12:22:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016090621] [2022-07-12 12:22:44,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:22:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 12:22:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:22:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 12:22:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-12 12:22:44,194 INFO L87 Difference]: Start difference. First operand 36439 states and 55940 transitions. Second operand has 24 states, 23 states have (on average 10.478260869565217) internal successors, (241), 17 states have internal predecessors, (241), 11 states have call successors, (75), 11 states have call predecessors, (75), 7 states have return successors, (69), 12 states have call predecessors, (69), 10 states have call successors, (69) [2022-07-12 12:23:03,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:05,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:07,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:13,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:15,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:18,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:20,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:22,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:23,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:25,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:27,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:23:29,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []