./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 02:15:42,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 02:15:42,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 02:15:42,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 02:15:42,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 02:15:42,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 02:15:42,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 02:15:42,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 02:15:42,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 02:15:42,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 02:15:42,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 02:15:42,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 02:15:42,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 02:15:42,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 02:15:42,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 02:15:42,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 02:15:42,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 02:15:42,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 02:15:42,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 02:15:42,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 02:15:42,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 02:15:42,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 02:15:42,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 02:15:42,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 02:15:42,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 02:15:42,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 02:15:42,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 02:15:42,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 02:15:42,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 02:15:42,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 02:15:42,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 02:15:42,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 02:15:42,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 02:15:42,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 02:15:42,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 02:15:42,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 02:15:42,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 02:15:42,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 02:15:42,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 02:15:42,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 02:15:42,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 02:15:42,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 02:15:42,205 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 02:15:42,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 02:15:42,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 02:15:42,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 02:15:42,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 02:15:42,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 02:15:42,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 02:15:42,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 02:15:42,210 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 02:15:42,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 02:15:42,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 02:15:42,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 02:15:42,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 02:15:42,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 02:15:42,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 02:15:42,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 02:15:42,212 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 02:15:42,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 02:15:42,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 02:15:42,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 02:15:42,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 02:15:42,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:15:42,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 02:15:42,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 02:15:42,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 02:15:42,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 02:15:42,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 02:15:42,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 02:15:42,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 02:15:42,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 02:15:42,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 02:15:42,216 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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2021-11-17 02:15:42,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 02:15:42,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 02:15:42,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 02:15:42,512 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 02:15:42,513 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 02:15:42,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:15:42,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c41597/90e035de0111463fba3d72946be1d980/FLAG5979bc57c [2021-11-17 02:15:43,233 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 02:15:43,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:15:43,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c41597/90e035de0111463fba3d72946be1d980/FLAG5979bc57c [2021-11-17 02:15:43,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0c41597/90e035de0111463fba3d72946be1d980 [2021-11-17 02:15:43,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 02:15:43,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 02:15:43,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 02:15:43,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 02:15:43,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 02:15:43,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:15:43" (1/1) ... [2021-11-17 02:15:43,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29bc8e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:43, skipping insertion in model container [2021-11-17 02:15:43,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:15:43" (1/1) ... [2021-11-17 02:15:43,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 02:15:43,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 02:15:44,269 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2021-11-17 02:15:44,334 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:15:44,357 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 02:15:44,508 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2021-11-17 02:15:44,530 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:15:44,567 INFO L208 MainTranslator]: Completed translation [2021-11-17 02:15:44,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44 WrapperNode [2021-11-17 02:15:44,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 02:15:44,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 02:15:44,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 02:15:44,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 02:15:44,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,693 INFO L137 Inliner]: procedures = 108, calls = 309, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 758 [2021-11-17 02:15:44,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 02:15:44,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 02:15:44,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 02:15:44,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 02:15:44,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 02:15:44,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 02:15:44,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 02:15:44,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 02:15:44,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (1/1) ... [2021-11-17 02:15:44,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:15:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:15:44,849 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) [2021-11-17 02:15:44,870 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 [2021-11-17 02:15:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 02:15:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 02:15:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 02:15:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 02:15:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 02:15:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 02:15:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 02:15:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 02:15:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 02:15:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2021-11-17 02:15:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2021-11-17 02:15:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 02:15:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 02:15:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 02:15:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 02:15:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 02:15:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2021-11-17 02:15:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2021-11-17 02:15:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 02:15:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 02:15:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 02:15:44,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 02:15:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 02:15:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 02:15:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 02:15:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 02:15:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 02:15:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 02:15:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-11-17 02:15:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-11-17 02:15:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-17 02:15:44,897 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-17 02:15:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:15:44,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:15:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 02:15:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 02:15:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 02:15:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 02:15:44,898 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 02:15:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 02:15:44,898 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 02:15:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 02:15:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 02:15:44,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 02:15:45,243 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 02:15:45,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 02:15:45,341 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 02:15:45,806 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 02:15:45,818 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 02:15:45,819 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 02:15:45,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:15:45 BoogieIcfgContainer [2021-11-17 02:15:45,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 02:15:45,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 02:15:45,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 02:15:45,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 02:15:45,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:15:43" (1/3) ... [2021-11-17 02:15:45,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd2d0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:15:45, skipping insertion in model container [2021-11-17 02:15:45,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:15:44" (2/3) ... [2021-11-17 02:15:45,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd2d0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:15:45, skipping insertion in model container [2021-11-17 02:15:45,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:15:45" (3/3) ... [2021-11-17 02:15:45,832 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:15:45,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 02:15:45,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 02:15:45,883 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 02:15:45,889 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 02:15:45,890 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 02:15:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 183 states have internal predecessors, (224), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2021-11-17 02:15:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:15:45,924 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:45,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:45,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1798989029, now seen corresponding path program 1 times [2021-11-17 02:15:45,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:45,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289103855] [2021-11-17 02:15:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:45,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 02:15:46,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:46,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289103855] [2021-11-17 02:15:46,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289103855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:46,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:46,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 02:15:46,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037258823] [2021-11-17 02:15:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:46,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:15:46,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:46,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:15:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 02:15:46,386 INFO L87 Difference]: Start difference. First operand has 231 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 183 states have internal predecessors, (224), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 02:15:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:46,779 INFO L93 Difference]: Finished difference Result 464 states and 628 transitions. [2021-11-17 02:15:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:15:46,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2021-11-17 02:15:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:46,792 INFO L225 Difference]: With dead ends: 464 [2021-11-17 02:15:46,807 INFO L226 Difference]: Without dead ends: 227 [2021-11-17 02:15:46,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 02:15:46,815 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 46 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:46,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 616 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-17 02:15:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2021-11-17 02:15:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 172 states have internal predecessors, (212), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-17 02:15:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2021-11-17 02:15:46,918 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 32 [2021-11-17 02:15:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:46,918 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2021-11-17 02:15:46,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 02:15:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2021-11-17 02:15:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:15:46,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:46,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:46,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 02:15:46,922 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1376287203, now seen corresponding path program 1 times [2021-11-17 02:15:46,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:46,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339721807] [2021-11-17 02:15:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:46,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 02:15:47,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:47,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339721807] [2021-11-17 02:15:47,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339721807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:47,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:47,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:47,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367081545] [2021-11-17 02:15:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:47,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:47,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:47,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:47,033 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 02:15:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:47,581 INFO L93 Difference]: Finished difference Result 638 states and 833 transitions. [2021-11-17 02:15:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 02:15:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2021-11-17 02:15:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:47,595 INFO L225 Difference]: With dead ends: 638 [2021-11-17 02:15:47,596 INFO L226 Difference]: Without dead ends: 423 [2021-11-17 02:15:47,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:47,602 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 300 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:47,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 841 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 02:15:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-11-17 02:15:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2021-11-17 02:15:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 309 states have (on average 1.2686084142394822) internal successors, (392), 317 states have internal predecessors, (392), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 02:15:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 529 transitions. [2021-11-17 02:15:47,652 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 529 transitions. Word has length 32 [2021-11-17 02:15:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:47,653 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 529 transitions. [2021-11-17 02:15:47,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 02:15:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 529 transitions. [2021-11-17 02:15:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:15:47,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:47,657 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:47,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 02:15:47,657 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash 451634024, now seen corresponding path program 1 times [2021-11-17 02:15:47,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:47,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675984283] [2021-11-17 02:15:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:47,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:47,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:47,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675984283] [2021-11-17 02:15:47,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675984283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:47,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:47,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 02:15:47,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751184613] [2021-11-17 02:15:47,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:47,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:15:47,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:15:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:47,782 INFO L87 Difference]: Start difference. First operand 409 states and 529 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 02:15:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:48,330 INFO L93 Difference]: Finished difference Result 970 states and 1293 transitions. [2021-11-17 02:15:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 02:15:48,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2021-11-17 02:15:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:48,335 INFO L225 Difference]: With dead ends: 970 [2021-11-17 02:15:48,335 INFO L226 Difference]: Without dead ends: 576 [2021-11-17 02:15:48,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:15:48,338 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 641 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:48,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 1280 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 02:15:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-17 02:15:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 412. [2021-11-17 02:15:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 312 states have (on average 1.2628205128205128) internal successors, (394), 320 states have internal predecessors, (394), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 02:15:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 531 transitions. [2021-11-17 02:15:48,371 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 531 transitions. Word has length 55 [2021-11-17 02:15:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:48,371 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 531 transitions. [2021-11-17 02:15:48,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 02:15:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 531 transitions. [2021-11-17 02:15:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:15:48,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:48,374 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:48,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 02:15:48,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1188950696, now seen corresponding path program 1 times [2021-11-17 02:15:48,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:48,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316162322] [2021-11-17 02:15:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:48,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:48,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:48,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316162322] [2021-11-17 02:15:48,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316162322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:48,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:48,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:48,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433241408] [2021-11-17 02:15:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:48,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:48,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:48,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:48,515 INFO L87 Difference]: Start difference. First operand 412 states and 531 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:48,990 INFO L93 Difference]: Finished difference Result 1233 states and 1608 transitions. [2021-11-17 02:15:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 02:15:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2021-11-17 02:15:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:48,996 INFO L225 Difference]: With dead ends: 1233 [2021-11-17 02:15:48,996 INFO L226 Difference]: Without dead ends: 836 [2021-11-17 02:15:48,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:48,999 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 310 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:48,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 833 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 02:15:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-11-17 02:15:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 798. [2021-11-17 02:15:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 609 states have (on average 1.2594417077175697) internal successors, (767), 621 states have internal predecessors, (767), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1032 transitions. [2021-11-17 02:15:49,041 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1032 transitions. Word has length 55 [2021-11-17 02:15:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:49,042 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1032 transitions. [2021-11-17 02:15:49,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1032 transitions. [2021-11-17 02:15:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-17 02:15:49,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:49,044 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:49,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 02:15:49,045 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1797229676, now seen corresponding path program 1 times [2021-11-17 02:15:49,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:49,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185709426] [2021-11-17 02:15:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:49,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:49,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:49,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185709426] [2021-11-17 02:15:49,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185709426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:49,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:49,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:49,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578501159] [2021-11-17 02:15:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:49,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:49,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:49,202 INFO L87 Difference]: Start difference. First operand 798 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:49,515 INFO L93 Difference]: Finished difference Result 828 states and 1077 transitions. [2021-11-17 02:15:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:15:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2021-11-17 02:15:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:49,520 INFO L225 Difference]: With dead ends: 828 [2021-11-17 02:15:49,520 INFO L226 Difference]: Without dead ends: 825 [2021-11-17 02:15:49,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:49,521 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 267 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:49,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 579 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-11-17 02:15:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 797. [2021-11-17 02:15:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 609 states have (on average 1.257799671592775) internal successors, (766), 620 states have internal predecessors, (766), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1030 transitions. [2021-11-17 02:15:49,563 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1030 transitions. Word has length 56 [2021-11-17 02:15:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:49,564 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1030 transitions. [2021-11-17 02:15:49,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1030 transitions. [2021-11-17 02:15:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-17 02:15:49,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:49,566 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:49,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 02:15:49,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 120464171, now seen corresponding path program 1 times [2021-11-17 02:15:49,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:49,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130629380] [2021-11-17 02:15:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:49,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:49,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:49,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130629380] [2021-11-17 02:15:49,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130629380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:49,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:49,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:49,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958985059] [2021-11-17 02:15:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:49,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:49,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:49,673 INFO L87 Difference]: Start difference. First operand 797 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:49,963 INFO L93 Difference]: Finished difference Result 827 states and 1075 transitions. [2021-11-17 02:15:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:15:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2021-11-17 02:15:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:49,967 INFO L225 Difference]: With dead ends: 827 [2021-11-17 02:15:49,968 INFO L226 Difference]: Without dead ends: 824 [2021-11-17 02:15:49,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:49,969 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:49,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 575 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:15:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-11-17 02:15:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 796. [2021-11-17 02:15:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 609 states have (on average 1.2561576354679802) internal successors, (765), 619 states have internal predecessors, (765), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1028 transitions. [2021-11-17 02:15:50,008 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1028 transitions. Word has length 57 [2021-11-17 02:15:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:50,009 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1028 transitions. [2021-11-17 02:15:50,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1028 transitions. [2021-11-17 02:15:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-17 02:15:50,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:50,010 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:50,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 02:15:50,011 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash -560563849, now seen corresponding path program 1 times [2021-11-17 02:15:50,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:50,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86061810] [2021-11-17 02:15:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:50,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:50,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:50,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86061810] [2021-11-17 02:15:50,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86061810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:50,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:50,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:50,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475425755] [2021-11-17 02:15:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:50,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:50,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:50,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:50,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:50,131 INFO L87 Difference]: Start difference. First operand 796 states and 1028 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:50,388 INFO L93 Difference]: Finished difference Result 826 states and 1073 transitions. [2021-11-17 02:15:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:15:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2021-11-17 02:15:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:50,392 INFO L225 Difference]: With dead ends: 826 [2021-11-17 02:15:50,393 INFO L226 Difference]: Without dead ends: 823 [2021-11-17 02:15:50,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:50,394 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 298 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:50,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 420 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:15:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-11-17 02:15:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 795. [2021-11-17 02:15:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 609 states have (on average 1.2545155993431856) internal successors, (764), 618 states have internal predecessors, (764), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1026 transitions. [2021-11-17 02:15:50,432 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1026 transitions. Word has length 58 [2021-11-17 02:15:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:50,434 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1026 transitions. [2021-11-17 02:15:50,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1026 transitions. [2021-11-17 02:15:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-17 02:15:50,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:50,435 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 02:15:50,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 02:15:50,436 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash -197591122, now seen corresponding path program 1 times [2021-11-17 02:15:50,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:50,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105201478] [2021-11-17 02:15:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:50,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-17 02:15:50,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:50,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105201478] [2021-11-17 02:15:50,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105201478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:50,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:50,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:15:50,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591366607] [2021-11-17 02:15:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:50,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:50,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:15:50,540 INFO L87 Difference]: Start difference. First operand 795 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:50,850 INFO L93 Difference]: Finished difference Result 825 states and 1071 transitions. [2021-11-17 02:15:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:15:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2021-11-17 02:15:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:50,854 INFO L225 Difference]: With dead ends: 825 [2021-11-17 02:15:50,855 INFO L226 Difference]: Without dead ends: 813 [2021-11-17 02:15:50,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:50,856 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 258 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:50,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 570 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-11-17 02:15:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 785. [2021-11-17 02:15:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 600 states have (on average 1.2533333333333334) internal successors, (752), 608 states have internal predecessors, (752), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2021-11-17 02:15:50,892 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 59 [2021-11-17 02:15:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:50,893 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2021-11-17 02:15:50,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 02:15:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2021-11-17 02:15:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-17 02:15:50,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:50,896 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:50,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 02:15:50,897 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash 415459010, now seen corresponding path program 1 times [2021-11-17 02:15:50,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:50,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871142196] [2021-11-17 02:15:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:50,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 02:15:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:15:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 02:15:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 02:15:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 02:15:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 02:15:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 02:15:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 02:15:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 02:15:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 02:15:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 02:15:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 02:15:51,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:51,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871142196] [2021-11-17 02:15:51,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871142196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:51,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:51,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 02:15:51,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036829915] [2021-11-17 02:15:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:51,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:15:51,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:15:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:15:51,103 INFO L87 Difference]: Start difference. First operand 785 states and 1013 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:51,438 INFO L93 Difference]: Finished difference Result 1647 states and 2141 transitions. [2021-11-17 02:15:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:15:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2021-11-17 02:15:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:51,443 INFO L225 Difference]: With dead ends: 1647 [2021-11-17 02:15:51,443 INFO L226 Difference]: Without dead ends: 877 [2021-11-17 02:15:51,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:15:51,446 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 171 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:51,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 790 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2021-11-17 02:15:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 839. [2021-11-17 02:15:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 653 states have (on average 1.2649310872894335) internal successors, (826), 661 states have internal predecessors, (826), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1087 transitions. [2021-11-17 02:15:51,492 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1087 transitions. Word has length 159 [2021-11-17 02:15:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:51,492 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1087 transitions. [2021-11-17 02:15:51,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1087 transitions. [2021-11-17 02:15:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 02:15:51,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:51,496 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:51,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 02:15:51,497 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1466528889, now seen corresponding path program 1 times [2021-11-17 02:15:51,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:51,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573733429] [2021-11-17 02:15:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:51,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:15:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 02:15:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-17 02:15:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 02:15:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 02:15:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-17 02:15:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 02:15:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 02:15:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 02:15:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 02:15:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 02:15:51,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:51,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573733429] [2021-11-17 02:15:51,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573733429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:51,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:15:51,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 02:15:51,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541894537] [2021-11-17 02:15:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:51,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 02:15:51,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 02:15:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:15:51,692 INFO L87 Difference]: Start difference. First operand 839 states and 1087 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:52,115 INFO L93 Difference]: Finished difference Result 2261 states and 3026 transitions. [2021-11-17 02:15:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:15:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2021-11-17 02:15:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:52,123 INFO L225 Difference]: With dead ends: 2261 [2021-11-17 02:15:52,123 INFO L226 Difference]: Without dead ends: 1441 [2021-11-17 02:15:52,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:15:52,129 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 491 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:52,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 1613 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2021-11-17 02:15:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 851. [2021-11-17 02:15:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 665 states have (on average 1.2601503759398496) internal successors, (838), 673 states have internal predecessors, (838), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2021-11-17 02:15:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1099 transitions. [2021-11-17 02:15:52,181 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1099 transitions. Word has length 168 [2021-11-17 02:15:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:52,182 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1099 transitions. [2021-11-17 02:15:52,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1099 transitions. [2021-11-17 02:15:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-17 02:15:52,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:52,187 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:52,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 02:15:52,187 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -527055154, now seen corresponding path program 1 times [2021-11-17 02:15:52,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:52,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37420953] [2021-11-17 02:15:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:52,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:15:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 02:15:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:15:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 02:15:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 02:15:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 02:15:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 02:15:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 02:15:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:15:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 02:15:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 02:15:52,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:52,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37420953] [2021-11-17 02:15:52,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37420953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:15:52,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643624394] [2021-11-17 02:15:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:52,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:15:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:15:52,443 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) [2021-11-17 02:15:52,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 02:15:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:52,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 02:15:52,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:15:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 02:15:53,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:15:53,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643624394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:53,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:15:53,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-17 02:15:53,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027470252] [2021-11-17 02:15:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:53,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:53,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:15:53,186 INFO L87 Difference]: Start difference. First operand 851 states and 1099 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:53,361 INFO L93 Difference]: Finished difference Result 2761 states and 3600 transitions. [2021-11-17 02:15:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:15:53,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2021-11-17 02:15:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:53,370 INFO L225 Difference]: With dead ends: 2761 [2021-11-17 02:15:53,371 INFO L226 Difference]: Without dead ends: 1929 [2021-11-17 02:15:53,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-17 02:15:53,375 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 388 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:53,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 1824 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:15:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2021-11-17 02:15:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 887. [2021-11-17 02:15:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 693 states have (on average 1.2496392496392497) internal successors, (866), 701 states have internal predecessors, (866), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2021-11-17 02:15:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1143 transitions. [2021-11-17 02:15:53,468 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1143 transitions. Word has length 170 [2021-11-17 02:15:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:53,468 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 1143 transitions. [2021-11-17 02:15:53,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:15:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1143 transitions. [2021-11-17 02:15:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-17 02:15:53,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:53,471 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:53,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 02:15:53,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-17 02:15:53,680 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1538172404, now seen corresponding path program 1 times [2021-11-17 02:15:53,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:53,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447005124] [2021-11-17 02:15:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:53,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:15:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 02:15:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:15:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 02:15:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 02:15:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 02:15:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 02:15:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 02:15:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:15:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 02:15:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 02:15:53,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:53,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447005124] [2021-11-17 02:15:53,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447005124] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:15:53,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881159133] [2021-11-17 02:15:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:53,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:15:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:15:53,979 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) [2021-11-17 02:15:54,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 02:15:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:54,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-17 02:15:54,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:15:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 02:15:54,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:15:54,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881159133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:54,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:15:54,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2021-11-17 02:15:54,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834629957] [2021-11-17 02:15:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:54,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:15:54,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:15:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:15:54,726 INFO L87 Difference]: Start difference. First operand 887 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 02:15:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:54,856 INFO L93 Difference]: Finished difference Result 2381 states and 3188 transitions. [2021-11-17 02:15:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:15:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 170 [2021-11-17 02:15:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:54,864 INFO L225 Difference]: With dead ends: 2381 [2021-11-17 02:15:54,864 INFO L226 Difference]: Without dead ends: 1513 [2021-11-17 02:15:54,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:15:54,867 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 147 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:54,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 1494 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:15:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-11-17 02:15:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 915. [2021-11-17 02:15:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 713 states have (on average 1.2482468443197756) internal successors, (890), 721 states have internal predecessors, (890), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (159), 145 states have call predecessors, (159), 141 states have call successors, (159) [2021-11-17 02:15:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1191 transitions. [2021-11-17 02:15:54,948 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1191 transitions. Word has length 170 [2021-11-17 02:15:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:54,949 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1191 transitions. [2021-11-17 02:15:54,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 02:15:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1191 transitions. [2021-11-17 02:15:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-17 02:15:54,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:54,952 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:54,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 02:15:55,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-17 02:15:55,180 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:55,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1639605590, now seen corresponding path program 1 times [2021-11-17 02:15:55,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:55,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947931499] [2021-11-17 02:15:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:55,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:15:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 02:15:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:15:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 02:15:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 02:15:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 02:15:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 02:15:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 02:15:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 02:15:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 02:15:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 02:15:55,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:55,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947931499] [2021-11-17 02:15:55,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947931499] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:15:55,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140732924] [2021-11-17 02:15:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:55,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:15:55,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:15:55,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 02:15:55,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 02:15:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:55,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-17 02:15:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:15:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 02:15:56,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:15:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 02:15:56,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140732924] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 02:15:56,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 02:15:56,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-11-17 02:15:56,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535737928] [2021-11-17 02:15:56,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 02:15:56,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-17 02:15:56,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-17 02:15:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-11-17 02:15:56,786 INFO L87 Difference]: Start difference. First operand 915 states and 1191 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 13 states have internal predecessors, (165), 4 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 02:15:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:57,664 INFO L93 Difference]: Finished difference Result 2053 states and 2700 transitions. [2021-11-17 02:15:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 02:15:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 13 states have internal predecessors, (165), 4 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) Word has length 176 [2021-11-17 02:15:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:57,670 INFO L225 Difference]: With dead ends: 2053 [2021-11-17 02:15:57,670 INFO L226 Difference]: Without dead ends: 1149 [2021-11-17 02:15:57,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2021-11-17 02:15:57,674 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 219 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:57,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 4515 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 02:15:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-11-17 02:15:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 955. [2021-11-17 02:15:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 745 states have (on average 1.2375838926174496) internal successors, (922), 749 states have internal predecessors, (922), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (171), 157 states have call predecessors, (171), 145 states have call successors, (171) [2021-11-17 02:15:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1239 transitions. [2021-11-17 02:15:57,742 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1239 transitions. Word has length 176 [2021-11-17 02:15:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:15:57,743 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 1239 transitions. [2021-11-17 02:15:57,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 13 states have internal predecessors, (165), 4 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 02:15:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1239 transitions. [2021-11-17 02:15:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-17 02:15:57,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:15:57,746 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:15:57,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-17 02:15:57,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:15:57,960 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:15:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:15:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash -775817686, now seen corresponding path program 2 times [2021-11-17 02:15:57,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:15:57,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016212468] [2021-11-17 02:15:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:15:57,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:15:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:15:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:15:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:15:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:15:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:15:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 02:15:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 02:15:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:15:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 02:15:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 02:15:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:15:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 02:15:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 02:15:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 02:15:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:15:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-11-17 02:15:58,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:15:58,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016212468] [2021-11-17 02:15:58,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016212468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:15:58,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938016436] [2021-11-17 02:15:58,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:15:58,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:15:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:15:58,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 02:15:58,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 02:15:59,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 02:15:59,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:15:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-17 02:15:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:15:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-17 02:15:59,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:15:59,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938016436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:15:59,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:15:59,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2021-11-17 02:15:59,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129957121] [2021-11-17 02:15:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:15:59,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:15:59,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:15:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:15:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-11-17 02:15:59,459 INFO L87 Difference]: Start difference. First operand 955 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 02:15:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:15:59,968 INFO L93 Difference]: Finished difference Result 2701 states and 3596 transitions. [2021-11-17 02:15:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:15:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 188 [2021-11-17 02:15:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:15:59,977 INFO L225 Difference]: With dead ends: 2701 [2021-11-17 02:15:59,978 INFO L226 Difference]: Without dead ends: 1755 [2021-11-17 02:15:59,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-11-17 02:15:59,982 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 659 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:15:59,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 1257 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:15:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-11-17 02:16:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1185. [2021-11-17 02:16:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 932 states have (on average 1.2263948497854078) internal successors, (1143), 938 states have internal predecessors, (1143), 167 states have call successors, (167), 74 states have call predecessors, (167), 85 states have return successors, (204), 184 states have call predecessors, (204), 166 states have call successors, (204) [2021-11-17 02:16:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1514 transitions. [2021-11-17 02:16:00,073 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1514 transitions. Word has length 188 [2021-11-17 02:16:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:16:00,073 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1514 transitions. [2021-11-17 02:16:00,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 02:16:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1514 transitions. [2021-11-17 02:16:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-17 02:16:00,077 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:16:00,077 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:16:00,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-17 02:16:00,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:16:00,304 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:16:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:16:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1597693430, now seen corresponding path program 1 times [2021-11-17 02:16:00,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:16:00,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041547360] [2021-11-17 02:16:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:16:00,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:16:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:16:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:16:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:16:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:16:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 02:16:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 02:16:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 02:16:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:16:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 02:16:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-17 02:16:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 02:16:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-11-17 02:16:00,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:16:00,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041547360] [2021-11-17 02:16:00,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041547360] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:16:00,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385028044] [2021-11-17 02:16:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:16:00,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:16:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:16:00,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 02:16:00,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-17 02:16:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:00,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 02:16:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:16:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-11-17 02:16:01,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:16:01,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385028044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:16:01,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:16:01,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-11-17 02:16:01,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946749315] [2021-11-17 02:16:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:16:01,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:16:01,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:16:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:16:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:16:01,350 INFO L87 Difference]: Start difference. First operand 1185 states and 1514 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 02:16:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:16:01,639 INFO L93 Difference]: Finished difference Result 3197 states and 4088 transitions. [2021-11-17 02:16:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:16:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 213 [2021-11-17 02:16:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:16:01,653 INFO L225 Difference]: With dead ends: 3197 [2021-11-17 02:16:01,653 INFO L226 Difference]: Without dead ends: 3189 [2021-11-17 02:16:01,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:16:01,658 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 387 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:16:01,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 1051 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:16:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2021-11-17 02:16:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3173. [2021-11-17 02:16:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2493 states have (on average 1.229041315683915) internal successors, (3064), 2515 states have internal predecessors, (3064), 450 states have call successors, (450), 196 states have call predecessors, (450), 229 states have return successors, (551), 493 states have call predecessors, (551), 449 states have call successors, (551) [2021-11-17 02:16:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4065 transitions. [2021-11-17 02:16:01,878 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4065 transitions. Word has length 213 [2021-11-17 02:16:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:16:01,878 INFO L470 AbstractCegarLoop]: Abstraction has 3173 states and 4065 transitions. [2021-11-17 02:16:01,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 02:16:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4065 transitions. [2021-11-17 02:16:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-17 02:16:01,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:16:01,884 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:16:01,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 02:16:02,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 02:16:02,098 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:16:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:16:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1686156616, now seen corresponding path program 1 times [2021-11-17 02:16:02,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:16:02,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905631702] [2021-11-17 02:16:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:16:02,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:16:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:16:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:16:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:16:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:16:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 02:16:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 02:16:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 02:16:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:16:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 02:16:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-17 02:16:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 02:16:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-11-17 02:16:02,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:16:02,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905631702] [2021-11-17 02:16:02,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905631702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:16:02,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:16:02,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 02:16:02,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235196922] [2021-11-17 02:16:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:16:02,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 02:16:02,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:16:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 02:16:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:16:02,313 INFO L87 Difference]: Start difference. First operand 3173 states and 4065 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-17 02:16:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:16:03,221 INFO L93 Difference]: Finished difference Result 8933 states and 11518 transitions. [2021-11-17 02:16:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 02:16:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 213 [2021-11-17 02:16:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:16:03,254 INFO L225 Difference]: With dead ends: 8933 [2021-11-17 02:16:03,254 INFO L226 Difference]: Without dead ends: 5779 [2021-11-17 02:16:03,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-11-17 02:16:03,264 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 600 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 02:16:03,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 1414 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 02:16:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2021-11-17 02:16:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5265. [2021-11-17 02:16:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 4108 states have (on average 1.2327166504381695) internal successors, (5064), 4174 states have internal predecessors, (5064), 767 states have call successors, (767), 334 states have call predecessors, (767), 389 states have return successors, (934), 808 states have call predecessors, (934), 766 states have call successors, (934) [2021-11-17 02:16:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 6765 transitions. [2021-11-17 02:16:03,768 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 6765 transitions. Word has length 213 [2021-11-17 02:16:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:16:03,768 INFO L470 AbstractCegarLoop]: Abstraction has 5265 states and 6765 transitions. [2021-11-17 02:16:03,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-17 02:16:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 6765 transitions. [2021-11-17 02:16:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-17 02:16:03,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:16:03,778 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:16:03,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 02:16:03,778 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:16:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:16:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1835294450, now seen corresponding path program 1 times [2021-11-17 02:16:03,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:16:03,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913427570] [2021-11-17 02:16:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:16:03,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:16:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:16:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:16:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:16:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:16:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:16:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 02:16:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 02:16:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:16:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 02:16:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 02:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:16:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 02:16:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-17 02:16:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 02:16:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 02:16:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-11-17 02:16:04,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:16:04,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913427570] [2021-11-17 02:16:04,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913427570] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:16:04,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974271837] [2021-11-17 02:16:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:16:04,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:16:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:16:04,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 02:16:04,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-17 02:16:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:16:04,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 127 conjunts are in the unsatisfiable core [2021-11-17 02:16:04,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:16:04,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-17 02:16:04,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-17 02:16:05,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-17 02:16:05,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-17 02:16:05,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2021-11-17 02:16:05,936 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-17 02:16:05,936 INFO L388 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-11-17 02:16:05,949 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-17 02:16:05,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2021-11-17 02:16:06,363 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 02:16:06,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2021-11-17 02:16:10,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-17 02:16:36,919 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-17 02:16:36,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2021-11-17 02:16:38,068 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 02:16:38,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2021-11-17 02:17:26,841 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-17 02:17:26,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2021-11-17 02:18:44,091 INFO L354 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2021-11-17 02:18:44,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 43 [2021-11-17 02:18:44,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2021-11-17 02:19:48,852 INFO L354 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2021-11-17 02:19:48,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 43 [2021-11-17 02:19:48,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2021-11-17 02:19:48,907 INFO L354 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2021-11-17 02:19:48,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 52 [2021-11-17 02:19:48,918 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-17 02:19:48,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2021-11-17 02:20:51,384 WARN L227 SmtUtils]: Spent 27.90s on a formula simplification. DAG size of input: 1000 DAG size of output: 554 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-17 02:20:51,385 INFO L354 Elim1Store]: treesize reduction 6192, result has 18.5 percent of original size [2021-11-17 02:20:51,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 77 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 81 new quantified variables, introduced 159 case distinctions, treesize of input 511583312887 treesize of output 225967992185 Killed by 15