./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-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_1a-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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 02:14:00,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 02:14:00,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 02:14:00,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 02:14:00,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 02:14:00,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 02:14:00,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 02:14:00,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 02:14:00,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 02:14:00,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 02:14:00,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 02:14:00,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 02:14:00,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 02:14:00,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 02:14:00,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 02:14:00,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 02:14:00,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 02:14:00,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 02:14:00,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 02:14:00,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 02:14:00,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 02:14:00,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 02:14:00,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 02:14:00,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 02:14:00,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 02:14:00,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 02:14:00,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 02:14:00,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 02:14:00,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 02:14:00,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 02:14:00,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 02:14:00,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 02:14:00,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 02:14:00,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 02:14:00,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 02:14:00,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 02:14:00,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 02:14:00,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 02:14:00,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 02:14:00,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 02:14:00,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 02:14:00,721 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:14:00,741 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 02:14:00,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 02:14:00,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 02:14:00,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 02:14:00,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 02:14:00,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 02:14:00,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 02:14:00,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 02:14:00,746 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 02:14:00,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 02:14:00,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 02:14:00,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 02:14:00,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 02:14:00,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 02:14:00,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 02:14:00,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 02:14:00,748 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 02:14:00,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 02:14:00,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 02:14:00,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 02:14:00,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 02:14:00,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:14:00,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 02:14:00,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 02:14:00,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 02:14:00,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 02:14:00,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 02:14:00,750 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 02:14:00,750 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 02:14:00,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 02:14:00,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 02:14:00,751 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2021-11-17 02:14:00,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 02:14:00,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 02:14:00,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 02:14:00,996 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 02:14:00,996 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 02:14:00,998 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:14:01,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7477c008/3b371b9c979a4b7481adb182c53c70f3/FLAGcfdb4a67f [2021-11-17 02:14:01,610 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 02:14:01,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:14:01,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7477c008/3b371b9c979a4b7481adb182c53c70f3/FLAGcfdb4a67f [2021-11-17 02:14:01,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7477c008/3b371b9c979a4b7481adb182c53c70f3 [2021-11-17 02:14:01,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 02:14:01,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 02:14:01,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 02:14:01,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 02:14:01,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 02:14:01,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:14:01" (1/1) ... [2021-11-17 02:14:01,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bd163f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:01, skipping insertion in model container [2021-11-17 02:14:01,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:14:01" (1/1) ... [2021-11-17 02:14:01,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 02:14:01,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 02:14:02,534 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2021-11-17 02:14:02,577 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:14:02,597 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 02:14:02,792 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2021-11-17 02:14:02,810 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:14:02,843 INFO L208 MainTranslator]: Completed translation [2021-11-17 02:14:02,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02 WrapperNode [2021-11-17 02:14:02,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 02:14:02,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 02:14:02,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 02:14:02,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 02:14:02,852 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:14:02" (1/1) ... [2021-11-17 02:14:02,878 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:14:02" (1/1) ... [2021-11-17 02:14:02,939 INFO L137 Inliner]: procedures = 110, calls = 310, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 768 [2021-11-17 02:14:02,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 02:14:02,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 02:14:02,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 02:14:02,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 02:14:02,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:02,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:02,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:02,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:02,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:02,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:03,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:03,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 02:14:03,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 02:14:03,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 02:14:03,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 02:14:03,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (1/1) ... [2021-11-17 02:14:03,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:14:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:03,097 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:14:03,112 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:14:03,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 02:14:03,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 02:14:03,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 02:14:03,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 02:14:03,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 02:14:03,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 02:14:03,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 02:14:03,147 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 02:14:03,148 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 02:14:03,148 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2021-11-17 02:14:03,148 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2021-11-17 02:14:03,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 02:14:03,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 02:14:03,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 02:14:03,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 02:14:03,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 02:14:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2021-11-17 02:14:03,149 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2021-11-17 02:14:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 02:14:03,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 02:14:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 02:14:03,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 02:14:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 02:14:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 02:14:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 02:14:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 02:14:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 02:14:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 02:14:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-11-17 02:14:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-11-17 02:14:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-17 02:14:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-17 02:14:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:14:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:14:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 02:14:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 02:14:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 02:14:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 02:14:03,152 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 02:14:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 02:14:03,152 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 02:14:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 02:14:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 02:14:03,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 02:14:03,432 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 02:14:03,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 02:14:03,501 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 02:14:04,009 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 02:14:04,020 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 02:14:04,020 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 02:14:04,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:14:04 BoogieIcfgContainer [2021-11-17 02:14:04,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 02:14:04,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 02:14:04,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 02:14:04,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 02:14:04,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:14:01" (1/3) ... [2021-11-17 02:14:04,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd3d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:14:04, skipping insertion in model container [2021-11-17 02:14:04,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:14:02" (2/3) ... [2021-11-17 02:14:04,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd3d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:14:04, skipping insertion in model container [2021-11-17 02:14:04,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:14:04" (3/3) ... [2021-11-17 02:14:04,032 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:14:04,036 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 02:14:04,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 02:14:04,088 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 02:14:04,095 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:14:04,095 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 02:14:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 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:14:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:14:04,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:04,129 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:14:04,129 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1664570800, now seen corresponding path program 1 times [2021-11-17 02:14:04,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:04,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132496813] [2021-11-17 02:14:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:04,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:04,534 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:14:04,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:04,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132496813] [2021-11-17 02:14:04,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132496813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:04,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:04,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 02:14:04,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416765105] [2021-11-17 02:14:04,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:04,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:14:04,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:14:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 02:14:04,565 INFO L87 Difference]: Start difference. First operand has 233 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 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:14:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:04,843 INFO L93 Difference]: Finished difference Result 468 states and 636 transitions. [2021-11-17 02:14:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:14:04,846 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:14:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:04,856 INFO L225 Difference]: With dead ends: 468 [2021-11-17 02:14:04,856 INFO L226 Difference]: Without dead ends: 229 [2021-11-17 02:14:04,860 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:14:04,864 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 90 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:04,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 457 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:14:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-17 02:14:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2021-11-17 02:14:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 173 states have internal predecessors, (215), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-17 02:14:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2021-11-17 02:14:04,922 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 32 [2021-11-17 02:14:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:04,923 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2021-11-17 02:14:04,924 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:14:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2021-11-17 02:14:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:14:04,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:04,928 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:14:04,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 02:14:04,930 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1241868974, now seen corresponding path program 1 times [2021-11-17 02:14:04,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:04,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88670530] [2021-11-17 02:14:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:04,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,081 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:14:05,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:05,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88670530] [2021-11-17 02:14:05,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88670530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:05,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:05,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:14:05,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709014612] [2021-11-17 02:14:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:05,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:05,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:14:05,085 INFO L87 Difference]: Start difference. First operand 222 states and 289 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:14:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:05,724 INFO L93 Difference]: Finished difference Result 646 states and 850 transitions. [2021-11-17 02:14:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 02:14:05,725 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:14:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:05,729 INFO L225 Difference]: With dead ends: 646 [2021-11-17 02:14:05,729 INFO L226 Difference]: Without dead ends: 429 [2021-11-17 02:14:05,731 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:14:05,732 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 312 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:05,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 847 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 02:14:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-11-17 02:14:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 415. [2021-11-17 02:14:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 314 states have (on average 1.2738853503184713) internal successors, (400), 321 states have internal predecessors, (400), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 02:14:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 540 transitions. [2021-11-17 02:14:05,771 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 540 transitions. Word has length 32 [2021-11-17 02:14:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:05,771 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 540 transitions. [2021-11-17 02:14:05,771 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:14:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 540 transitions. [2021-11-17 02:14:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:14:05,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:05,774 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:14:05,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 02:14:05,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1658921169, now seen corresponding path program 1 times [2021-11-17 02:14:05,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:05,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365752934] [2021-11-17 02:14:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:05,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:05,918 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:14:05,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:05,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365752934] [2021-11-17 02:14:05,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365752934] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:05,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:05,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 02:14:05,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104305087] [2021-11-17 02:14:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:05,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:14:05,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:14:05,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:14:05,921 INFO L87 Difference]: Start difference. First operand 415 states and 540 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:14:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:06,521 INFO L93 Difference]: Finished difference Result 980 states and 1316 transitions. [2021-11-17 02:14:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 02:14:06,522 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:14:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:06,526 INFO L225 Difference]: With dead ends: 980 [2021-11-17 02:14:06,526 INFO L226 Difference]: Without dead ends: 580 [2021-11-17 02:14:06,528 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:14:06,529 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 608 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:06,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 1558 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 02:14:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-17 02:14:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 418. [2021-11-17 02:14:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 317 states have (on average 1.2681388012618298) internal successors, (402), 324 states have internal predecessors, (402), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 02:14:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 542 transitions. [2021-11-17 02:14:06,565 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 542 transitions. Word has length 55 [2021-11-17 02:14:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:06,566 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 542 transitions. [2021-11-17 02:14:06,566 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:14:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 542 transitions. [2021-11-17 02:14:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:14:06,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:06,569 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:14:06,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 02:14:06,569 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1898729455, now seen corresponding path program 1 times [2021-11-17 02:14:06,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:06,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876579720] [2021-11-17 02:14:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:06,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:06,665 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:14:06,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:06,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876579720] [2021-11-17 02:14:06,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876579720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:06,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:06,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:14:06,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100772893] [2021-11-17 02:14:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:06,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:06,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:14:06,668 INFO L87 Difference]: Start difference. First operand 418 states and 542 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:14:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:07,202 INFO L93 Difference]: Finished difference Result 1245 states and 1635 transitions. [2021-11-17 02:14:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 02:14:07,203 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:14:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:07,213 INFO L225 Difference]: With dead ends: 1245 [2021-11-17 02:14:07,213 INFO L226 Difference]: Without dead ends: 842 [2021-11-17 02:14:07,215 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:14:07,223 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 312 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:07,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 993 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 02:14:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-11-17 02:14:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 812. [2021-11-17 02:14:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 620 states have (on average 1.2629032258064516) internal successors, (783), 631 states have internal predecessors, (783), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1053 transitions. [2021-11-17 02:14:07,289 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1053 transitions. Word has length 55 [2021-11-17 02:14:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:07,290 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1053 transitions. [2021-11-17 02:14:07,290 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:14:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1053 transitions. [2021-11-17 02:14:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-17 02:14:07,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:07,297 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:14:07,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 02:14:07,297 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1268938597, now seen corresponding path program 1 times [2021-11-17 02:14:07,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:07,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585126663] [2021-11-17 02:14:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:07,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,414 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:14:07,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:07,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585126663] [2021-11-17 02:14:07,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585126663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:07,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:07,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:14:07,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169036452] [2021-11-17 02:14:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:07,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:07,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:14:07,417 INFO L87 Difference]: Start difference. First operand 812 states and 1053 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:14:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:07,672 INFO L93 Difference]: Finished difference Result 842 states and 1102 transitions. [2021-11-17 02:14:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:14:07,673 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:14:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:07,677 INFO L225 Difference]: With dead ends: 842 [2021-11-17 02:14:07,677 INFO L226 Difference]: Without dead ends: 839 [2021-11-17 02:14:07,678 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:14:07,678 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 273 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:07,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 583 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:14:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-17 02:14:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 811. [2021-11-17 02:14:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 620 states have (on average 1.261290322580645) internal successors, (782), 630 states have internal predecessors, (782), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1051 transitions. [2021-11-17 02:14:07,718 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1051 transitions. Word has length 56 [2021-11-17 02:14:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:07,718 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1051 transitions. [2021-11-17 02:14:07,719 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:14:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1051 transitions. [2021-11-17 02:14:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-17 02:14:07,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:07,720 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:14:07,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 02:14:07,720 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash 682405268, now seen corresponding path program 1 times [2021-11-17 02:14:07,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:07,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278693130] [2021-11-17 02:14:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:07,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:07,804 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:14:07,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:07,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278693130] [2021-11-17 02:14:07,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278693130] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:07,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:07,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:14:07,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549743655] [2021-11-17 02:14:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:07,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:07,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:14:07,806 INFO L87 Difference]: Start difference. First operand 811 states and 1051 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:14:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:08,132 INFO L93 Difference]: Finished difference Result 841 states and 1100 transitions. [2021-11-17 02:14:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:14:08,133 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:14:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:08,140 INFO L225 Difference]: With dead ends: 841 [2021-11-17 02:14:08,140 INFO L226 Difference]: Without dead ends: 838 [2021-11-17 02:14:08,141 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:14:08,142 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 270 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:08,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 579 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:14:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-11-17 02:14:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 810. [2021-11-17 02:14:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 620 states have (on average 1.2596774193548388) internal successors, (781), 629 states have internal predecessors, (781), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1049 transitions. [2021-11-17 02:14:08,182 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1049 transitions. Word has length 57 [2021-11-17 02:14:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:08,183 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1049 transitions. [2021-11-17 02:14:08,183 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:14:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1049 transitions. [2021-11-17 02:14:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-17 02:14:08,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:08,184 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:14:08,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 02:14:08,185 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash -320253880, now seen corresponding path program 1 times [2021-11-17 02:14:08,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:08,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399037847] [2021-11-17 02:14:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:08,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,322 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:14:08,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:08,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399037847] [2021-11-17 02:14:08,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399037847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:08,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:08,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:14:08,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786594807] [2021-11-17 02:14:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:08,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:08,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:14:08,325 INFO L87 Difference]: Start difference. First operand 810 states and 1049 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:14:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:08,534 INFO L93 Difference]: Finished difference Result 840 states and 1098 transitions. [2021-11-17 02:14:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:14:08,535 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:14:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:08,539 INFO L225 Difference]: With dead ends: 840 [2021-11-17 02:14:08,539 INFO L226 Difference]: Without dead ends: 829 [2021-11-17 02:14:08,540 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:14:08,541 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 307 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:08,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 426 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:14:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2021-11-17 02:14:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 801. [2021-11-17 02:14:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 612 states have (on average 1.2581699346405228) internal successors, (770), 620 states have internal predecessors, (770), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1037 transitions. [2021-11-17 02:14:08,580 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1037 transitions. Word has length 58 [2021-11-17 02:14:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:08,581 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1037 transitions. [2021-11-17 02:14:08,581 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:14:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1037 transitions. [2021-11-17 02:14:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-17 02:14:08,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:08,588 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] [2021-11-17 02:14:08,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 02:14:08,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1089358151, now seen corresponding path program 1 times [2021-11-17 02:14:08,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:08,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266722864] [2021-11-17 02:14:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:08,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 02:14:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 02:14:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 02:14:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 02:14:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 02:14:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 02:14:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 02:14:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 02:14:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 02:14:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 02:14:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:08,770 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:14:08,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:08,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266722864] [2021-11-17 02:14:08,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266722864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:08,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:08,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 02:14:08,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878688198] [2021-11-17 02:14:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:08,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:14:08,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:14:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:14:08,775 INFO L87 Difference]: Start difference. First operand 801 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:09,107 INFO L93 Difference]: Finished difference Result 1679 states and 2193 transitions. [2021-11-17 02:14:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:14:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 152 [2021-11-17 02:14:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:09,112 INFO L225 Difference]: With dead ends: 1679 [2021-11-17 02:14:09,113 INFO L226 Difference]: Without dead ends: 893 [2021-11-17 02:14:09,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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:14:09,116 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 224 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:09,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 805 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:14:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-11-17 02:14:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 855. [2021-11-17 02:14:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 665 states have (on average 1.2691729323308272) internal successors, (844), 673 states have internal predecessors, (844), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1111 transitions. [2021-11-17 02:14:09,160 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1111 transitions. Word has length 152 [2021-11-17 02:14:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:09,161 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1111 transitions. [2021-11-17 02:14:09,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1111 transitions. [2021-11-17 02:14:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-17 02:14:09,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:09,165 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] [2021-11-17 02:14:09,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 02:14:09,165 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1490878930, now seen corresponding path program 1 times [2021-11-17 02:14:09,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:09,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357012919] [2021-11-17 02:14:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:09,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 02:14:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 02:14:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-17 02:14:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 02:14:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 02:14:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 02:14:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 02:14:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 02:14:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,350 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:14:09,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:09,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357012919] [2021-11-17 02:14:09,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357012919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:09,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:09,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 02:14:09,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126869906] [2021-11-17 02:14:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:09,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 02:14:09,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 02:14:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:14:09,353 INFO L87 Difference]: Start difference. First operand 855 states and 1111 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:09,804 INFO L93 Difference]: Finished difference Result 2289 states and 3072 transitions. [2021-11-17 02:14:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:14:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 161 [2021-11-17 02:14:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:09,811 INFO L225 Difference]: With dead ends: 2289 [2021-11-17 02:14:09,811 INFO L226 Difference]: Without dead ends: 1453 [2021-11-17 02:14:09,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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:14:09,816 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 382 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:09,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 2075 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 02:14:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-11-17 02:14:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 867. [2021-11-17 02:14:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 677 states have (on average 1.2644017725258494) internal successors, (856), 685 states have internal predecessors, (856), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2021-11-17 02:14:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2021-11-17 02:14:09,863 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 161 [2021-11-17 02:14:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:09,865 INFO L470 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2021-11-17 02:14:09,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2021-11-17 02:14:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 02:14:09,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:09,869 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] [2021-11-17 02:14:09,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 02:14:09,869 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1123553049, now seen corresponding path program 1 times [2021-11-17 02:14:09,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:09,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468559711] [2021-11-17 02:14:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:09,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 02:14:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:14:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 02:14:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 02:14:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 02:14:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:14:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,114 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:14:10,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:10,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468559711] [2021-11-17 02:14:10,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468559711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:10,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343883262] [2021-11-17 02:14:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:10,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:10,119 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:14:10,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 02:14:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:10,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 02:14:10,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:10,800 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:14:10,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:14:10,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343883262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:10,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:14:10,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-17 02:14:10,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991396527] [2021-11-17 02:14:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:10,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:10,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:14:10,802 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:10,976 INFO L93 Difference]: Finished difference Result 2809 states and 3670 transitions. [2021-11-17 02:14:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:14:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2021-11-17 02:14:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:10,986 INFO L225 Difference]: With dead ends: 2809 [2021-11-17 02:14:10,986 INFO L226 Difference]: Without dead ends: 1961 [2021-11-17 02:14:10,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 193 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:14:10,989 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 395 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1873 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:14:10,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1873 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:14:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2021-11-17 02:14:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 903. [2021-11-17 02:14:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 705 states have (on average 1.2539007092198582) internal successors, (884), 713 states have internal predecessors, (884), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2021-11-17 02:14:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1167 transitions. [2021-11-17 02:14:11,046 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1167 transitions. Word has length 163 [2021-11-17 02:14:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:11,046 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 1167 transitions. [2021-11-17 02:14:11,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1167 transitions. [2021-11-17 02:14:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 02:14:11,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:11,050 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] [2021-11-17 02:14:11,080 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:14:11,268 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,SelfDestructingSolverStorable9 [2021-11-17 02:14:11,269 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 112435799, now seen corresponding path program 1 times [2021-11-17 02:14:11,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:11,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403492698] [2021-11-17 02:14:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:11,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 02:14:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:14:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 02:14:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 02:14:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 02:14:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 02:14:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,503 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:14:11,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:11,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403492698] [2021-11-17 02:14:11,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403492698] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:11,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885574635] [2021-11-17 02:14:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:11,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:11,505 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:14:11,507 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:14:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:11,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-17 02:14:11,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-17 02:14:12,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:14:12,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885574635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:12,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:14:12,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2021-11-17 02:14:12,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784809559] [2021-11-17 02:14:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:12,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:14:12,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:14:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-17 02:14:12,297 INFO L87 Difference]: Start difference. First operand 903 states and 1167 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:12,408 INFO L93 Difference]: Finished difference Result 2153 states and 2858 transitions. [2021-11-17 02:14:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:14:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2021-11-17 02:14:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:12,416 INFO L225 Difference]: With dead ends: 2153 [2021-11-17 02:14:12,417 INFO L226 Difference]: Without dead ends: 1269 [2021-11-17 02:14:12,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-17 02:14:12,421 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 91 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:12,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1855 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:14:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2021-11-17 02:14:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 923. [2021-11-17 02:14:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 721 states have (on average 1.248266296809986) internal successors, (900), 729 states have internal predecessors, (900), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2021-11-17 02:14:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1203 transitions. [2021-11-17 02:14:12,511 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1203 transitions. Word has length 163 [2021-11-17 02:14:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:12,512 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1203 transitions. [2021-11-17 02:14:12,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:14:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1203 transitions. [2021-11-17 02:14:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 02:14:12,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:12,515 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] [2021-11-17 02:14:12,550 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:14:12,738 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,SelfDestructingSolverStorable10 [2021-11-17 02:14:12,739 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -853180109, now seen corresponding path program 1 times [2021-11-17 02:14:12,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:12,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430855308] [2021-11-17 02:14:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:12,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 02:14:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 02:14:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 02:14:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 02:14:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-17 02:14:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 02:14:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 02:14:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:12,999 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:14:12,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:13,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430855308] [2021-11-17 02:14:13,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430855308] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:13,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143325837] [2021-11-17 02:14:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:13,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:13,002 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:14:13,036 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:14:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:13,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-17 02:14:13,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-17 02:14:13,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:14:13,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143325837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:13,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:14:13,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2021-11-17 02:14:13,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733180941] [2021-11-17 02:14:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:13,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:14:13,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:14:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:14:13,633 INFO L87 Difference]: Start difference. First operand 923 states and 1203 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:14:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:13,697 INFO L93 Difference]: Finished difference Result 1847 states and 2419 transitions. [2021-11-17 02:14:13,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:14:13,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 169 [2021-11-17 02:14:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:13,702 INFO L225 Difference]: With dead ends: 1847 [2021-11-17 02:14:13,703 INFO L226 Difference]: Without dead ends: 943 [2021-11-17 02:14:13,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:14:13,706 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:13,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1118 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:14:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-11-17 02:14:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 931. [2021-11-17 02:14:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 733 states have internal predecessors, (908), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2021-11-17 02:14:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1211 transitions. [2021-11-17 02:14:13,795 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1211 transitions. Word has length 169 [2021-11-17 02:14:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:13,796 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1211 transitions. [2021-11-17 02:14:13,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:14:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1211 transitions. [2021-11-17 02:14:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 02:14:13,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:13,800 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 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] [2021-11-17 02:14:13,829 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:14:14,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:14,023 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -68871857, now seen corresponding path program 2 times [2021-11-17 02:14:14,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:14,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328140359] [2021-11-17 02:14:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:14,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 02:14:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 02:14:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 02:14:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 02:14:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 02:14:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 02:14:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-17 02:14:14,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:14,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328140359] [2021-11-17 02:14:14,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328140359] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:14,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902649237] [2021-11-17 02:14:14,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:14:14,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:14,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:14,396 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:14:14,423 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:14:15,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 02:14:15,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:14:15,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-17 02:14:15,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-17 02:14:15,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:14:15,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902649237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:15,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:14:15,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2021-11-17 02:14:15,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85752398] [2021-11-17 02:14:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:15,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:14:15,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:15,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:14:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-11-17 02:14:15,433 INFO L87 Difference]: Start difference. First operand 931 states and 1211 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:14:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:15,754 INFO L93 Difference]: Finished difference Result 1893 states and 2543 transitions. [2021-11-17 02:14:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:14:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2021-11-17 02:14:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:15,761 INFO L225 Difference]: With dead ends: 1893 [2021-11-17 02:14:15,762 INFO L226 Difference]: Without dead ends: 1433 [2021-11-17 02:14:15,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-17 02:14:15,765 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 587 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:15,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 1809 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:14:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2021-11-17 02:14:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 937. [2021-11-17 02:14:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 735 states have (on average 1.2435374149659864) internal successors, (914), 739 states have internal predecessors, (914), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2021-11-17 02:14:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1217 transitions. [2021-11-17 02:14:15,850 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1217 transitions. Word has length 175 [2021-11-17 02:14:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:15,850 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1217 transitions. [2021-11-17 02:14:15,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 02:14:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1217 transitions. [2021-11-17 02:14:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 02:14:15,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:15,854 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 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] [2021-11-17 02:14:15,879 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:14:16,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:16,068 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1068489238, now seen corresponding path program 1 times [2021-11-17 02:14:16,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:16,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669665356] [2021-11-17 02:14:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:16,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 02:14:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 02:14:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 02:14:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 02:14:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 02:14:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 02:14:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 02:14:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 02:14:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-17 02:14:16,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:16,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669665356] [2021-11-17 02:14:16,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669665356] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:16,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866133108] [2021-11-17 02:14:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:16,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:16,297 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:14:16,328 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:14:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:16,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 02:14:16,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 02:14:17,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:14:17,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866133108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:17,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:14:17,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-11-17 02:14:17,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787150015] [2021-11-17 02:14:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:17,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:14:17,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:14:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:14:17,156 INFO L87 Difference]: Start difference. First operand 937 states and 1217 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 02:14:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:17,389 INFO L93 Difference]: Finished difference Result 2775 states and 3614 transitions. [2021-11-17 02:14:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:14:17,389 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2021-11-17 02:14:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:17,401 INFO L225 Difference]: With dead ends: 2775 [2021-11-17 02:14:17,402 INFO L226 Difference]: Without dead ends: 2767 [2021-11-17 02:14:17,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 244 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:14:17,404 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 399 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:17,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 1079 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:14:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2021-11-17 02:14:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2753. [2021-11-17 02:14:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2163 states have (on average 1.2473416551086454) internal successors, (2698), 2179 states have internal predecessors, (2698), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2021-11-17 02:14:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3593 transitions. [2021-11-17 02:14:17,610 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3593 transitions. Word has length 206 [2021-11-17 02:14:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:17,611 INFO L470 AbstractCegarLoop]: Abstraction has 2753 states and 3593 transitions. [2021-11-17 02:14:17,611 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 02:14:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3593 transitions. [2021-11-17 02:14:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 02:14:17,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:17,617 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 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] [2021-11-17 02:14:17,643 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:14:17,843 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,SelfDestructingSolverStorable13 [2021-11-17 02:14:17,843 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash 57371988, now seen corresponding path program 1 times [2021-11-17 02:14:17,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:17,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424277316] [2021-11-17 02:14:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:17,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 02:14:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 02:14:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 02:14:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 02:14:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 02:14:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 02:14:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 02:14:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 02:14:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:18,046 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:14:18,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:18,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424277316] [2021-11-17 02:14:18,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424277316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:14:18,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:14:18,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 02:14:18,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619136990] [2021-11-17 02:14:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:14:18,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 02:14:18,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:14:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 02:14:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:14:18,048 INFO L87 Difference]: Start difference. First operand 2753 states and 3593 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 02:14:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:14:19,065 INFO L93 Difference]: Finished difference Result 8847 states and 11608 transitions. [2021-11-17 02:14:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 02:14:19,066 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 206 [2021-11-17 02:14:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:14:19,092 INFO L225 Difference]: With dead ends: 8847 [2021-11-17 02:14:19,092 INFO L226 Difference]: Without dead ends: 6113 [2021-11-17 02:14:19,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 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:14:19,102 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 466 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 02:14:19,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 1634 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 02:14:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2021-11-17 02:14:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 2765. [2021-11-17 02:14:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2175 states have (on average 1.2459770114942528) internal successors, (2710), 2195 states have internal predecessors, (2710), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2021-11-17 02:14:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3605 transitions. [2021-11-17 02:14:19,401 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3605 transitions. Word has length 206 [2021-11-17 02:14:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:14:19,404 INFO L470 AbstractCegarLoop]: Abstraction has 2765 states and 3605 transitions. [2021-11-17 02:14:19,404 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 02:14:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3605 transitions. [2021-11-17 02:14:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-17 02:14:19,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:14:19,410 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:14:19,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 02:14:19,410 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:14:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:14:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 570510040, now seen corresponding path program 1 times [2021-11-17 02:14:19,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:14:19,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008573938] [2021-11-17 02:14:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:19,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:14:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 02:14:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:14:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 02:14:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 02:14:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 02:14:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 02:14:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 02:14:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:14:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 02:14:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:14:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 02:14:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 02:14:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 02:14:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 02:14:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-11-17 02:14:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-11-17 02:14:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-17 02:14:19,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:14:19,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008573938] [2021-11-17 02:14:19,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008573938] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:14:19,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79276730] [2021-11-17 02:14:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:14:19,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:14:19,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:14:19,848 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:14:19,878 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:14:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:14:20,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-17 02:14:20,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:14:20,257 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:14:20,321 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:14:21,153 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 13 treesize of output 12 [2021-11-17 02:14:21,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-11-17 02:14:31,289 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-17 02:14:31,292 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 24 treesize of output 26 [2021-11-17 02:14:31,299 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-17 02:14:31,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-11-17 02:17:42,029 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-11-17 02:17:42,030 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 3 case distinctions, treesize of input 36 treesize of output 51 [2021-11-17 02:17:42,040 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 16 treesize of output 1 [2021-11-17 02:17:54,356 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| Int) (|v_ldv_init_zalloc_#t~malloc65.base_5| Int)) (let ((.cse2 (= |v_ldv_init_zalloc_#t~malloc65.base_5| 0)) (.cse3 ((as const (Array Int Int)) 0))) (and (or (exists ((|v_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_int| 0))) (= .cse0 (let ((.cse1 (+ |v_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset_BEFORE_CALL_1| 216))) (store ((as const (Array Int Int)) 0) .cse1 (select .cse0 .cse1)))))) (not .cse2)) (not (= |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| 0)) (= .cse3 (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|)) (not (= |v_ldv_init_zalloc_#t~malloc65.base_5| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|)) (or .cse2 (= .cse3 (select |c_#memory_int| |v_ldv_init_zalloc_#t~malloc65.base_5|)))))) is different from true [2021-11-17 02:18:03,044 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-11-17 02:18:03,045 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 3 case distinctions, treesize of input 62 treesize of output 73 [2021-11-17 02:18:03,058 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 16 treesize of output 1 [2021-11-17 02:18:15,294 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-11-17 02:18:15,295 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 3 case distinctions, treesize of input 109 treesize of output 116 [2021-11-17 02:18:15,299 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-17 02:18:15,299 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:18:15,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-17 02:18:15,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967062184] [2021-11-17 02:18:15,299 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 02:18:15,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 02:18:15,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:18:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 02:18:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1544, Unknown=30, NotChecked=80, Total=1806 [2021-11-17 02:18:15,304 INFO L87 Difference]: Start difference. First operand 2765 states and 3605 transitions. Second operand has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 7 states have internal predecessors, (136), 3 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 02:18:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 02:18:15,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 147 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 232.0s TimeCoverageRelationStatistics Valid=152, Invalid=1544, Unknown=30, NotChecked=80, Total=1806 [2021-11-17 02:18:15,306 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:15,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:15,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:15,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-17 02:18:15,524 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3c6e3451 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 02:18:15,527 INFO L158 Benchmark]: Toolchain (without parser) took 253684.27ms. Allocated memory was 92.3MB in the beginning and 396.4MB in the end (delta: 304.1MB). Free memory was 54.4MB in the beginning and 231.6MB in the end (delta: -177.2MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,527 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 02:18:15,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 998.51ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 54.2MB in the beginning and 61.4MB in the end (delta: -7.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.13ms. Allocated memory is still 111.1MB. Free memory was 61.0MB in the beginning and 55.1MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,528 INFO L158 Benchmark]: Boogie Preprocessor took 68.06ms. Allocated memory is still 111.1MB. Free memory was 55.1MB in the beginning and 49.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,530 INFO L158 Benchmark]: RCFGBuilder took 1010.07ms. Allocated memory was 111.1MB in the beginning and 174.1MB in the end (delta: 62.9MB). Free memory was 49.6MB in the beginning and 112.0MB in the end (delta: -62.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,531 INFO L158 Benchmark]: TraceAbstraction took 251502.33ms. Allocated memory was 174.1MB in the beginning and 396.4MB in the end (delta: 222.3MB). Free memory was 111.1MB in the beginning and 231.6MB in the end (delta: -120.5MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2021-11-17 02:18:15,532 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 998.51ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 54.2MB in the beginning and 61.4MB in the end (delta: -7.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.13ms. Allocated memory is still 111.1MB. Free memory was 61.0MB in the beginning and 55.1MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.06ms. Allocated memory is still 111.1MB. Free memory was 55.1MB in the beginning and 49.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.07ms. Allocated memory was 111.1MB in the beginning and 174.1MB in the end (delta: 62.9MB). Free memory was 49.6MB in the beginning and 112.0MB in the end (delta: -62.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 251502.33ms. Allocated memory was 174.1MB in the beginning and 396.4MB in the end (delta: 222.3MB). Free memory was 111.1MB in the beginning and 231.6MB in the end (delta: -120.5MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3c6e3451 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3c6e3451: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-17 02:18:15,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_1a-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_Bitvector.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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 02:18:17,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 02:18:17,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 02:18:17,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 02:18:17,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 02:18:17,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 02:18:17,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 02:18:17,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 02:18:17,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 02:18:17,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 02:18:17,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 02:18:17,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 02:18:17,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 02:18:17,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 02:18:17,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 02:18:17,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 02:18:17,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 02:18:17,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 02:18:17,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 02:18:17,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 02:18:17,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 02:18:17,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 02:18:17,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 02:18:17,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 02:18:17,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 02:18:17,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 02:18:17,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 02:18:17,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 02:18:17,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 02:18:17,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 02:18:17,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 02:18:17,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 02:18:17,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 02:18:17,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 02:18:17,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 02:18:17,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 02:18:17,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 02:18:17,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 02:18:17,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 02:18:17,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 02:18:17,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 02:18:17,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 02:18:17,551 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 02:18:17,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 02:18:17,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 02:18:17,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 02:18:17,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 02:18:17,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 02:18:17,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 02:18:17,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 02:18:17,555 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 02:18:17,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 02:18:17,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 02:18:17,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 02:18:17,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 02:18:17,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 02:18:17,557 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 02:18:17,557 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 02:18:17,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 02:18:17,557 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 02:18:17,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 02:18:17,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 02:18:17,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 02:18:17,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 02:18:17,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:18:17,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 02:18:17,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 02:18:17,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 02:18:17,559 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 02:18:17,559 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 02:18:17,559 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 02:18:17,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 02:18:17,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 02:18:17,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 02:18:17,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 02:18:17,560 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2021-11-17 02:18:17,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 02:18:17,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 02:18:17,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 02:18:17,877 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 02:18:17,877 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 02:18:17,878 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:18:17,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befe39e72/36400c2579e9480195b583559b266ea9/FLAG5568d8d56 [2021-11-17 02:18:18,528 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 02:18:18,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:18:18,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befe39e72/36400c2579e9480195b583559b266ea9/FLAG5568d8d56 [2021-11-17 02:18:18,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befe39e72/36400c2579e9480195b583559b266ea9 [2021-11-17 02:18:18,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 02:18:18,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 02:18:18,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 02:18:18,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 02:18:18,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 02:18:18,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:18:18" (1/1) ... [2021-11-17 02:18:18,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9c6fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:18, skipping insertion in model container [2021-11-17 02:18:18,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:18:18" (1/1) ... [2021-11-17 02:18:18,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 02:18:19,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 02:18:19,617 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2021-11-17 02:18:19,643 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:18:19,674 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 02:18:19,865 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2021-11-17 02:18:19,880 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:18:19,924 INFO L208 MainTranslator]: Completed translation [2021-11-17 02:18:19,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19 WrapperNode [2021-11-17 02:18:19,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 02:18:19,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 02:18:19,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 02:18:19,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 02:18:19,931 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:18:19" (1/1) ... [2021-11-17 02:18:19,981 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:18:19" (1/1) ... [2021-11-17 02:18:20,050 INFO L137 Inliner]: procedures = 119, calls = 310, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 748 [2021-11-17 02:18:20,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 02:18:20,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 02:18:20,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 02:18:20,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 02:18:20,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 02:18:20,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 02:18:20,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 02:18:20,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 02:18:20,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (1/1) ... [2021-11-17 02:18:20,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:18:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:18:20,159 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:18:20,213 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:18:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 02:18:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 02:18:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 02:18:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-17 02:18:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 02:18:20,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 02:18:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 02:18:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 02:18:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 02:18:20,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 02:18:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 02:18:20,233 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 02:18:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2021-11-17 02:18:20,233 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2021-11-17 02:18:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 02:18:20,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 02:18:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 02:18:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 02:18:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2021-11-17 02:18:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2021-11-17 02:18:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 02:18:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 02:18:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 02:18:20,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 02:18:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 02:18:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 02:18:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 02:18:20,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 02:18:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 02:18:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 02:18:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-11-17 02:18:20,236 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-11-17 02:18:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-17 02:18:20,236 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-17 02:18:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:18:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2021-11-17 02:18:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 02:18:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 02:18:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 02:18:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 02:18:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 02:18:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 02:18:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-17 02:18:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 02:18:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 02:18:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 02:18:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 02:18:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 02:18:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 02:18:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 02:18:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 02:18:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 02:18:20,569 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 02:18:20,571 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 02:18:20,641 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 02:18:21,666 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 02:18:21,673 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 02:18:21,673 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 02:18:21,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:18:21 BoogieIcfgContainer [2021-11-17 02:18:21,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 02:18:21,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 02:18:21,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 02:18:21,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 02:18:21,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:18:18" (1/3) ... [2021-11-17 02:18:21,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546f982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:18:21, skipping insertion in model container [2021-11-17 02:18:21,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:18:19" (2/3) ... [2021-11-17 02:18:21,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546f982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:18:21, skipping insertion in model container [2021-11-17 02:18:21,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:18:21" (3/3) ... [2021-11-17 02:18:21,681 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-17 02:18:21,685 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 02:18:21,685 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 02:18:21,728 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 02:18:21,740 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:18:21,740 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 02:18:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 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:18:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:18:21,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:21,771 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:18:21,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1664570800, now seen corresponding path program 1 times [2021-11-17 02:18:21,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:21,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421033689] [2021-11-17 02:18:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:21,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:21,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:21,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-17 02:18:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:22,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-17 02:18:22,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:22,210 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:18:22,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:22,337 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:18:22,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:22,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421033689] [2021-11-17 02:18:22,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421033689] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:22,339 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:22,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-17 02:18:22,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648254472] [2021-11-17 02:18:22,342 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:22,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-17 02:18:22,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:22,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-17 02:18:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 02:18:22,379 INFO L87 Difference]: Start difference. First operand has 233 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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:18:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:22,450 INFO L93 Difference]: Finished difference Result 461 states and 624 transitions. [2021-11-17 02:18:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 02:18:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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:18:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:22,465 INFO L225 Difference]: With dead ends: 461 [2021-11-17 02:18:22,465 INFO L226 Difference]: Without dead ends: 222 [2021-11-17 02:18:22,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 02:18:22,478 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:22,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-17 02:18:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-11-17 02:18:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 173 states have internal predecessors, (215), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-17 02:18:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2021-11-17 02:18:22,532 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 32 [2021-11-17 02:18:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:22,533 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2021-11-17 02:18:22,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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:18:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2021-11-17 02:18:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-17 02:18:22,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:22,535 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:18:22,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:22,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:22,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1241868974, now seen corresponding path program 1 times [2021-11-17 02:18:22,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:22,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002373274] [2021-11-17 02:18:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:22,742 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:22,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:22,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-17 02:18:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:22,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:22,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:23,056 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:18:23,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:23,148 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:18:23,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:23,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002373274] [2021-11-17 02:18:23,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002373274] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:23,149 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:23,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 02:18:23,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531175781] [2021-11-17 02:18:23,149 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:23,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:18:23,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:18:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 02:18:23,151 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 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:18:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:23,514 INFO L93 Difference]: Finished difference Result 814 states and 1068 transitions. [2021-11-17 02:18:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:18:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 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:18:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:23,519 INFO L225 Difference]: With dead ends: 814 [2021-11-17 02:18:23,519 INFO L226 Difference]: Without dead ends: 597 [2021-11-17 02:18:23,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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:18:23,521 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 518 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:23,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 1029 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 02:18:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-11-17 02:18:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2021-11-17 02:18:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 453 states have (on average 1.2781456953642385) internal successors, (579), 462 states have internal predecessors, (579), 103 states have call successors, (103), 41 states have call predecessors, (103), 40 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2021-11-17 02:18:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 781 transitions. [2021-11-17 02:18:23,591 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 781 transitions. Word has length 32 [2021-11-17 02:18:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:23,591 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 781 transitions. [2021-11-17 02:18:23,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 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:18:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 781 transitions. [2021-11-17 02:18:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:18:23,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:23,594 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:18:23,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:23,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:23,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1658921169, now seen corresponding path program 1 times [2021-11-17 02:18:23,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:23,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076791428] [2021-11-17 02:18:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:23,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:23,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:23,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-17 02:18:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:24,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 02:18:24,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:24,191 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:18:24,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:24,325 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:18:24,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:24,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076791428] [2021-11-17 02:18:24,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076791428] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:24,326 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:24,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-17 02:18:24,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612706515] [2021-11-17 02:18:24,326 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:24,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:18:24,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:18:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:18:24,329 INFO L87 Difference]: Start difference. First operand 597 states and 781 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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:18:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:24,601 INFO L93 Difference]: Finished difference Result 1454 states and 1955 transitions. [2021-11-17 02:18:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:18:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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:18:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:24,609 INFO L225 Difference]: With dead ends: 1454 [2021-11-17 02:18:24,609 INFO L226 Difference]: Without dead ends: 872 [2021-11-17 02:18:24,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:18:24,614 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 623 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:24,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 1116 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:18:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-11-17 02:18:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 600. [2021-11-17 02:18:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 456 states have (on average 1.2741228070175439) internal successors, (581), 465 states have internal predecessors, (581), 103 states have call successors, (103), 41 states have call predecessors, (103), 40 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2021-11-17 02:18:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 783 transitions. [2021-11-17 02:18:24,671 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 783 transitions. Word has length 55 [2021-11-17 02:18:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:24,671 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 783 transitions. [2021-11-17 02:18:24,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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:18:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 783 transitions. [2021-11-17 02:18:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-17 02:18:24,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:24,680 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:18:24,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:24,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:24,893 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1898729455, now seen corresponding path program 1 times [2021-11-17 02:18:24,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:24,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569000637] [2021-11-17 02:18:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:24,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:24,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:24,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-17 02:18:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:25,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:25,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:25,315 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:18:25,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:25,457 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:18:25,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:25,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569000637] [2021-11-17 02:18:25,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569000637] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:25,457 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:25,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 02:18:25,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491512497] [2021-11-17 02:18:25,458 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:25,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:18:25,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:18:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:25,459 INFO L87 Difference]: Start difference. First operand 600 states and 783 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:25,557 INFO L93 Difference]: Finished difference Result 1763 states and 2311 transitions. [2021-11-17 02:18:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:18:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2021-11-17 02:18:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:25,563 INFO L225 Difference]: With dead ends: 1763 [2021-11-17 02:18:25,564 INFO L226 Difference]: Without dead ends: 1178 [2021-11-17 02:18:25,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:25,566 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 245 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:25,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 659 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2021-11-17 02:18:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2021-11-17 02:18:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 898 states have (on average 1.2683741648106903) internal successors, (1139), 913 states have internal predecessors, (1139), 199 states have call successors, (199), 79 states have call predecessors, (199), 78 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2021-11-17 02:18:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1533 transitions. [2021-11-17 02:18:25,636 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1533 transitions. Word has length 55 [2021-11-17 02:18:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:25,637 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1533 transitions. [2021-11-17 02:18:25,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1533 transitions. [2021-11-17 02:18:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-17 02:18:25,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:25,640 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:18:25,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:25,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:25,854 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1268938597, now seen corresponding path program 1 times [2021-11-17 02:18:25,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:25,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668299103] [2021-11-17 02:18:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:25,855 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:25,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:25,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-17 02:18:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:26,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:26,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:26,248 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:18:26,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:26,389 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:18:26,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:26,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668299103] [2021-11-17 02:18:26,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668299103] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:26,390 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:26,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 02:18:26,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285998278] [2021-11-17 02:18:26,390 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:26,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:18:26,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:26,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:18:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:26,392 INFO L87 Difference]: Start difference. First operand 1176 states and 1533 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:26,436 INFO L93 Difference]: Finished difference Result 1178 states and 1534 transitions. [2021-11-17 02:18:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:18:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-11-17 02:18:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:26,442 INFO L225 Difference]: With dead ends: 1178 [2021-11-17 02:18:26,442 INFO L226 Difference]: Without dead ends: 1175 [2021-11-17 02:18:26,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:26,444 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:26,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 286 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-11-17 02:18:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2021-11-17 02:18:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 898 states have (on average 1.2672605790645879) internal successors, (1138), 912 states have internal predecessors, (1138), 198 states have call successors, (198), 79 states have call predecessors, (198), 78 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2021-11-17 02:18:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1531 transitions. [2021-11-17 02:18:26,514 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1531 transitions. Word has length 56 [2021-11-17 02:18:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:26,515 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1531 transitions. [2021-11-17 02:18:26,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1531 transitions. [2021-11-17 02:18:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-17 02:18:26,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:26,517 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:18:26,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-17 02:18:26,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:26,730 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 682405268, now seen corresponding path program 1 times [2021-11-17 02:18:26,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:26,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244142049] [2021-11-17 02:18:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:26,731 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:26,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:26,732 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:26,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-17 02:18:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:26,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:26,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:27,107 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:18:27,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:27,264 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:18:27,265 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:27,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244142049] [2021-11-17 02:18:27,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244142049] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:27,265 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:27,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 02:18:27,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899718489] [2021-11-17 02:18:27,266 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:27,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:18:27,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:18:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:27,267 INFO L87 Difference]: Start difference. First operand 1175 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:27,323 INFO L93 Difference]: Finished difference Result 1177 states and 1532 transitions. [2021-11-17 02:18:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:18:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2021-11-17 02:18:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:27,329 INFO L225 Difference]: With dead ends: 1177 [2021-11-17 02:18:27,329 INFO L226 Difference]: Without dead ends: 1174 [2021-11-17 02:18:27,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:27,330 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:27,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2021-11-17 02:18:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2021-11-17 02:18:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 898 states have (on average 1.2661469933184855) internal successors, (1137), 911 states have internal predecessors, (1137), 197 states have call successors, (197), 79 states have call predecessors, (197), 78 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2021-11-17 02:18:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1529 transitions. [2021-11-17 02:18:27,393 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1529 transitions. Word has length 57 [2021-11-17 02:18:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:27,393 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1529 transitions. [2021-11-17 02:18:27,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1529 transitions. [2021-11-17 02:18:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-17 02:18:27,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:27,395 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:18:27,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:27,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:27,608 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash -320253880, now seen corresponding path program 1 times [2021-11-17 02:18:27,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:27,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390518913] [2021-11-17 02:18:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:27,610 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:27,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:27,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-17 02:18:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:27,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:27,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:28,002 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:18:28,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:28,138 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:18:28,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:28,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390518913] [2021-11-17 02:18:28,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390518913] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:28,139 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:28,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 02:18:28,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655126864] [2021-11-17 02:18:28,139 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:28,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:18:28,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:18:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:28,140 INFO L87 Difference]: Start difference. First operand 1174 states and 1529 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:28,189 INFO L93 Difference]: Finished difference Result 1176 states and 1530 transitions. [2021-11-17 02:18:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:18:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2021-11-17 02:18:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:28,194 INFO L225 Difference]: With dead ends: 1176 [2021-11-17 02:18:28,195 INFO L226 Difference]: Without dead ends: 1165 [2021-11-17 02:18:28,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:28,196 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:28,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-11-17 02:18:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2021-11-17 02:18:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 890 states have (on average 1.2651685393258427) internal successors, (1126), 902 states have internal predecessors, (1126), 196 states have call successors, (196), 79 states have call predecessors, (196), 78 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2021-11-17 02:18:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1517 transitions. [2021-11-17 02:18:28,262 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1517 transitions. Word has length 58 [2021-11-17 02:18:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:28,262 INFO L470 AbstractCegarLoop]: Abstraction has 1165 states and 1517 transitions. [2021-11-17 02:18:28,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 02:18:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1517 transitions. [2021-11-17 02:18:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-17 02:18:28,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:28,266 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] [2021-11-17 02:18:28,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-17 02:18:28,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:28,486 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1089358151, now seen corresponding path program 1 times [2021-11-17 02:18:28,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:28,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281460845] [2021-11-17 02:18:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:28,487 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:28,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:28,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-17 02:18:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:28,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:18:28,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-17 02:18:29,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:29,424 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:18:29,424 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:29,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281460845] [2021-11-17 02:18:29,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281460845] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:29,425 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:29,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 02:18:29,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160340365] [2021-11-17 02:18:29,425 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:29,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:18:29,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:18:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:29,428 INFO L87 Difference]: Start difference. First operand 1165 states and 1517 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 02:18:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:29,550 INFO L93 Difference]: Finished difference Result 2405 states and 3145 transitions. [2021-11-17 02:18:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:18:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 152 [2021-11-17 02:18:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:29,557 INFO L225 Difference]: With dead ends: 2405 [2021-11-17 02:18:29,557 INFO L226 Difference]: Without dead ends: 1255 [2021-11-17 02:18:29,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 02:18:29,562 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 41 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:29,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:18:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-11-17 02:18:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1232. [2021-11-17 02:18:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 956 states have (on average 1.2751046025104602) internal successors, (1219), 968 states have internal predecessors, (1219), 196 states have call successors, (196), 80 states have call predecessors, (196), 79 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2021-11-17 02:18:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1610 transitions. [2021-11-17 02:18:29,638 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1610 transitions. Word has length 152 [2021-11-17 02:18:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:29,638 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1610 transitions. [2021-11-17 02:18:29,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 02:18:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1610 transitions. [2021-11-17 02:18:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-17 02:18:29,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:29,644 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] [2021-11-17 02:18:29,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:29,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:29,861 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1490878930, now seen corresponding path program 1 times [2021-11-17 02:18:29,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:29,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645501541] [2021-11-17 02:18:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:29,863 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:29,863 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:29,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-17 02:18:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:30,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 02:18:30,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-17 02:18:30,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:30,906 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:18:30,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:30,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645501541] [2021-11-17 02:18:30,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645501541] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 02:18:30,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:18:30,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-11-17 02:18:30,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996338552] [2021-11-17 02:18:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:30,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:18:30,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:18:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:18:30,908 INFO L87 Difference]: Start difference. First operand 1232 states and 1610 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:18:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:31,013 INFO L93 Difference]: Finished difference Result 2487 states and 3285 transitions. [2021-11-17 02:18:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:18:31,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 161 [2021-11-17 02:18:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:31,020 INFO L225 Difference]: With dead ends: 2487 [2021-11-17 02:18:31,020 INFO L226 Difference]: Without dead ends: 1274 [2021-11-17 02:18:31,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:18:31,024 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:31,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1118 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-11-17 02:18:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1256. [2021-11-17 02:18:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 974 states have (on average 1.2700205338809034) internal successors, (1237), 986 states have internal predecessors, (1237), 196 states have call successors, (196), 80 states have call predecessors, (196), 85 states have return successors, (225), 201 states have call predecessors, (225), 195 states have call successors, (225) [2021-11-17 02:18:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1658 transitions. [2021-11-17 02:18:31,089 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1658 transitions. Word has length 161 [2021-11-17 02:18:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:31,091 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 1658 transitions. [2021-11-17 02:18:31,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 02:18:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1658 transitions. [2021-11-17 02:18:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-17 02:18:31,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:31,095 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] [2021-11-17 02:18:31,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:31,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:31,312 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash 886339054, now seen corresponding path program 1 times [2021-11-17 02:18:31,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:31,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292050410] [2021-11-17 02:18:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:31,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:31,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:31,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-17 02:18:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:31,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 02:18:31,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 02:18:31,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-17 02:18:32,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:32,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292050410] [2021-11-17 02:18:32,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292050410] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:32,227 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:32,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-17 02:18:32,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261148971] [2021-11-17 02:18:32,227 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:32,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:18:32,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:18:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:18:32,228 INFO L87 Difference]: Start difference. First operand 1256 states and 1658 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 02:18:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:32,385 INFO L93 Difference]: Finished difference Result 3270 states and 4431 transitions. [2021-11-17 02:18:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:18:32,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2021-11-17 02:18:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:32,394 INFO L225 Difference]: With dead ends: 3270 [2021-11-17 02:18:32,395 INFO L226 Difference]: Without dead ends: 2033 [2021-11-17 02:18:32,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:18:32,398 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 332 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:32,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1361 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:18:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2021-11-17 02:18:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1274. [2021-11-17 02:18:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 992 states have (on average 1.2651209677419355) internal successors, (1255), 1004 states have internal predecessors, (1255), 196 states have call successors, (196), 80 states have call predecessors, (196), 85 states have return successors, (225), 201 states have call predecessors, (225), 195 states have call successors, (225) [2021-11-17 02:18:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1676 transitions. [2021-11-17 02:18:32,482 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1676 transitions. Word has length 167 [2021-11-17 02:18:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:32,482 INFO L470 AbstractCegarLoop]: Abstraction has 1274 states and 1676 transitions. [2021-11-17 02:18:32,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 02:18:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1676 transitions. [2021-11-17 02:18:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 02:18:32,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:32,486 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] [2021-11-17 02:18:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:32,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:32,705 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:32,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash -18682827, now seen corresponding path program 1 times [2021-11-17 02:18:32,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:32,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230535840] [2021-11-17 02:18:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:32,706 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:32,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:32,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-17 02:18:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:33,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-17 02:18:33,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-17 02:18:33,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 02:18:34,171 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:34,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230535840] [2021-11-17 02:18:34,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230535840] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 02:18:34,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:18:34,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2021-11-17 02:18:34,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761932738] [2021-11-17 02:18:34,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:34,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 02:18:34,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 02:18:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-17 02:18:34,173 INFO L87 Difference]: Start difference. First operand 1274 states and 1676 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 02:18:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:35,165 INFO L93 Difference]: Finished difference Result 3291 states and 4445 transitions. [2021-11-17 02:18:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 02:18:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2021-11-17 02:18:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:35,176 INFO L225 Difference]: With dead ends: 3291 [2021-11-17 02:18:35,176 INFO L226 Difference]: Without dead ends: 2036 [2021-11-17 02:18:35,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-11-17 02:18:35,180 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 203 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:35,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 3384 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 02:18:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2021-11-17 02:18:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1322. [2021-11-17 02:18:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1034 states have (on average 1.2543520309477756) internal successors, (1297), 1040 states have internal predecessors, (1297), 196 states have call successors, (196), 80 states have call predecessors, (196), 91 states have return successors, (237), 213 states have call predecessors, (237), 195 states have call successors, (237) [2021-11-17 02:18:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1730 transitions. [2021-11-17 02:18:35,264 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1730 transitions. Word has length 169 [2021-11-17 02:18:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:35,265 INFO L470 AbstractCegarLoop]: Abstraction has 1322 states and 1730 transitions. [2021-11-17 02:18:35,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 02:18:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1730 transitions. [2021-11-17 02:18:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 02:18:35,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:35,269 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 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] [2021-11-17 02:18:35,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:35,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:35,488 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1318126695, now seen corresponding path program 2 times [2021-11-17 02:18:35,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:35,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069899502] [2021-11-17 02:18:35,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:18:35,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:35,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:35,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-17 02:18:35,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 02:18:35,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:18:35,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-17 02:18:35,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-17 02:18:36,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-17 02:18:36,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:36,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069899502] [2021-11-17 02:18:36,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069899502] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:36,421 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:36,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-11-17 02:18:36,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748026880] [2021-11-17 02:18:36,421 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:36,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:18:36,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:18:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:18:36,423 INFO L87 Difference]: Start difference. First operand 1322 states and 1730 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 02:18:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:37,532 INFO L93 Difference]: Finished difference Result 2689 states and 3654 transitions. [2021-11-17 02:18:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:18:37,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2021-11-17 02:18:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:37,541 INFO L225 Difference]: With dead ends: 2689 [2021-11-17 02:18:37,541 INFO L226 Difference]: Without dead ends: 2027 [2021-11-17 02:18:37,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:18:37,543 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 738 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:37,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [764 Valid, 1814 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 02:18:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2021-11-17 02:18:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1331. [2021-11-17 02:18:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1043 states have (on average 1.25215723873442) internal successors, (1306), 1049 states have internal predecessors, (1306), 196 states have call successors, (196), 80 states have call predecessors, (196), 91 states have return successors, (237), 213 states have call predecessors, (237), 195 states have call successors, (237) [2021-11-17 02:18:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1739 transitions. [2021-11-17 02:18:37,632 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1739 transitions. Word has length 175 [2021-11-17 02:18:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:37,633 INFO L470 AbstractCegarLoop]: Abstraction has 1331 states and 1739 transitions. [2021-11-17 02:18:37,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 02:18:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1739 transitions. [2021-11-17 02:18:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 02:18:37,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:37,637 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 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] [2021-11-17 02:18:37,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:37,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:37,850 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1151185806, now seen corresponding path program 1 times [2021-11-17 02:18:37,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:37,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811022563] [2021-11-17 02:18:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:37,851 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:37,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:37,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-17 02:18:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:38,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-17 02:18:38,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-17 02:18:38,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-17 02:18:39,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:39,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811022563] [2021-11-17 02:18:39,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811022563] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 02:18:39,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 02:18:39,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-17 02:18:39,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230526077] [2021-11-17 02:18:39,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 02:18:39,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 02:18:39,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 02:18:39,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-17 02:18:39,416 INFO L87 Difference]: Start difference. First operand 1331 states and 1739 transitions. Second operand has 16 states, 16 states have (on average 9.4375) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 02:18:41,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 02:18:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:41,867 INFO L93 Difference]: Finished difference Result 2952 states and 3901 transitions. [2021-11-17 02:18:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:18:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) Word has length 206 [2021-11-17 02:18:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:41,875 INFO L225 Difference]: With dead ends: 2952 [2021-11-17 02:18:41,875 INFO L226 Difference]: Without dead ends: 1640 [2021-11-17 02:18:41,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-17 02:18:41,877 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 120 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:41,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 3961 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-17 02:18:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-17 02:18:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1343. [2021-11-17 02:18:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1049 states have (on average 1.2507149666348905) internal successors, (1312), 1055 states have internal predecessors, (1312), 202 states have call successors, (202), 80 states have call predecessors, (202), 91 states have return successors, (249), 219 states have call predecessors, (249), 201 states have call successors, (249) [2021-11-17 02:18:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1763 transitions. [2021-11-17 02:18:41,998 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1763 transitions. Word has length 206 [2021-11-17 02:18:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:41,998 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1763 transitions. [2021-11-17 02:18:41,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 02:18:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1763 transitions. [2021-11-17 02:18:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-17 02:18:42,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:42,005 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:42,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:42,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:42,220 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 498288242, now seen corresponding path program 2 times [2021-11-17 02:18:42,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:42,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381538581] [2021-11-17 02:18:42,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:18:42,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:42,223 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:42,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-17 02:18:43,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 02:18:43,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:18:43,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 02:18:43,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 02:18:43,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-17 02:18:44,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:44,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381538581] [2021-11-17 02:18:44,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381538581] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 02:18:44,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 02:18:44,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-17 02:18:44,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332482426] [2021-11-17 02:18:44,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 02:18:44,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:18:44,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:18:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:18:44,373 INFO L87 Difference]: Start difference. First operand 1343 states and 1763 transitions. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2021-11-17 02:18:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:45,751 INFO L93 Difference]: Finished difference Result 7956 states and 10475 transitions. [2021-11-17 02:18:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 02:18:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 212 [2021-11-17 02:18:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:45,788 INFO L225 Difference]: With dead ends: 7956 [2021-11-17 02:18:45,788 INFO L226 Difference]: Without dead ends: 7948 [2021-11-17 02:18:45,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:18:45,791 INFO L933 BasicCegarLoop]: 696 mSDtfsCounter, 998 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:45,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 2042 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-17 02:18:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2021-11-17 02:18:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 7872. [2021-11-17 02:18:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7872 states, 6148 states have (on average 1.252765126870527) internal successors, (7702), 6196 states have internal predecessors, (7702), 1192 states have call successors, (1192), 460 states have call predecessors, (1192), 531 states have return successors, (1479), 1287 states have call predecessors, (1479), 1191 states have call successors, (1479) [2021-11-17 02:18:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 10373 transitions. [2021-11-17 02:18:46,319 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 10373 transitions. Word has length 212 [2021-11-17 02:18:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:46,320 INFO L470 AbstractCegarLoop]: Abstraction has 7872 states and 10373 transitions. [2021-11-17 02:18:46,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2021-11-17 02:18:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 10373 transitions. [2021-11-17 02:18:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-17 02:18:46,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:46,334 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-17 02:18:46,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:46,546 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -512829008, now seen corresponding path program 1 times [2021-11-17 02:18:46,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:46,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920224392] [2021-11-17 02:18:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:46,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:46,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:46,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-17 02:18:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:47,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-17 02:18:47,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-17 02:18:47,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-17 02:18:47,865 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:47,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920224392] [2021-11-17 02:18:47,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920224392] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 02:18:47,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:18:47,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-17 02:18:47,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865745798] [2021-11-17 02:18:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:47,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:18:47,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:18:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:18:47,868 INFO L87 Difference]: Start difference. First operand 7872 states and 10373 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 02:18:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:48,503 INFO L93 Difference]: Finished difference Result 18938 states and 25506 transitions. [2021-11-17 02:18:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:18:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 212 [2021-11-17 02:18:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:48,544 INFO L225 Difference]: With dead ends: 18938 [2021-11-17 02:18:48,544 INFO L226 Difference]: Without dead ends: 11085 [2021-11-17 02:18:48,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:18:48,560 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 92 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:48,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 1859 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:18:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11085 states. [2021-11-17 02:18:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11085 to 7980. [2021-11-17 02:18:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7980 states, 6256 states have (on average 1.2484015345268542) internal successors, (7810), 6268 states have internal predecessors, (7810), 1192 states have call successors, (1192), 460 states have call predecessors, (1192), 531 states have return successors, (1479), 1323 states have call predecessors, (1479), 1191 states have call successors, (1479) [2021-11-17 02:18:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 10481 transitions. [2021-11-17 02:18:49,130 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 10481 transitions. Word has length 212 [2021-11-17 02:18:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:49,131 INFO L470 AbstractCegarLoop]: Abstraction has 7980 states and 10481 transitions. [2021-11-17 02:18:49,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 02:18:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 10481 transitions. [2021-11-17 02:18:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-17 02:18:49,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:49,147 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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] [2021-11-17 02:18:49,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:49,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:49,373 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1946076244, now seen corresponding path program 2 times [2021-11-17 02:18:49,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:49,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796424488] [2021-11-17 02:18:49,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:18:49,375 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:49,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:49,375 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:49,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-17 02:18:49,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 02:18:49,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:18:49,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 02:18:49,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-17 02:18:49,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-17 02:18:50,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:50,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796424488] [2021-11-17 02:18:50,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796424488] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:50,172 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:50,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-17 02:18:50,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986459636] [2021-11-17 02:18:50,173 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:50,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:18:50,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:18:50,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 02:18:50,174 INFO L87 Difference]: Start difference. First operand 7980 states and 10481 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 02:18:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:51,051 INFO L93 Difference]: Finished difference Result 25243 states and 33340 transitions. [2021-11-17 02:18:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:18:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 218 [2021-11-17 02:18:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:51,102 INFO L225 Difference]: With dead ends: 25243 [2021-11-17 02:18:51,103 INFO L226 Difference]: Without dead ends: 17282 [2021-11-17 02:18:51,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:18:51,128 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 336 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:51,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 957 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:18:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17282 states. [2021-11-17 02:18:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17282 to 8016. [2021-11-17 02:18:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8016 states, 6292 states have (on average 1.2469802924348379) internal successors, (7846), 6316 states have internal predecessors, (7846), 1192 states have call successors, (1192), 460 states have call predecessors, (1192), 531 states have return successors, (1479), 1311 states have call predecessors, (1479), 1191 states have call successors, (1479) [2021-11-17 02:18:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 10517 transitions. [2021-11-17 02:18:51,684 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 10517 transitions. Word has length 218 [2021-11-17 02:18:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:51,685 INFO L470 AbstractCegarLoop]: Abstraction has 8016 states and 10517 transitions. [2021-11-17 02:18:51,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 02:18:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 10517 transitions. [2021-11-17 02:18:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-17 02:18:51,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:51,701 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:18:51,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-17 02:18:51,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:51,914 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -61991976, now seen corresponding path program 1 times [2021-11-17 02:18:51,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:51,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954400327] [2021-11-17 02:18:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:51,916 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:51,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:51,917 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:51,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-17 02:18:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:52,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 02:18:52,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 02:18:52,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-17 02:18:53,202 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:53,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954400327] [2021-11-17 02:18:53,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954400327] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 02:18:53,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:18:53,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-17 02:18:53,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98825942] [2021-11-17 02:18:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:53,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:18:53,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:18:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:18:53,203 INFO L87 Difference]: Start difference. First operand 8016 states and 10517 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 02:18:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:53,896 INFO L93 Difference]: Finished difference Result 17690 states and 24174 transitions. [2021-11-17 02:18:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 02:18:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 225 [2021-11-17 02:18:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:53,938 INFO L225 Difference]: With dead ends: 17690 [2021-11-17 02:18:53,938 INFO L226 Difference]: Without dead ends: 13641 [2021-11-17 02:18:53,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-17 02:18:53,952 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 303 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:53,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 1874 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:18:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13641 states. [2021-11-17 02:18:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13641 to 8124. [2021-11-17 02:18:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8124 states, 6400 states have (on average 1.2428125) internal successors, (7954), 6388 states have internal predecessors, (7954), 1192 states have call successors, (1192), 460 states have call predecessors, (1192), 531 states have return successors, (1479), 1347 states have call predecessors, (1479), 1191 states have call successors, (1479) [2021-11-17 02:18:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8124 states to 8124 states and 10625 transitions. [2021-11-17 02:18:54,675 INFO L78 Accepts]: Start accepts. Automaton has 8124 states and 10625 transitions. Word has length 225 [2021-11-17 02:18:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:54,675 INFO L470 AbstractCegarLoop]: Abstraction has 8124 states and 10625 transitions. [2021-11-17 02:18:54,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 02:18:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8124 states and 10625 transitions. [2021-11-17 02:18:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-11-17 02:18:54,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:54,691 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:54,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:54,908 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1402819212, now seen corresponding path program 2 times [2021-11-17 02:18:54,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:54,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346000269] [2021-11-17 02:18:54,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 02:18:54,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:54,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:54,911 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:54,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-17 02:18:56,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 02:18:56,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 02:18:56,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 02:18:56,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-11-17 02:18:56,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:18:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 02:18:57,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:18:57,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346000269] [2021-11-17 02:18:57,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346000269] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:18:57,077 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:18:57,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 02:18:57,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501269203] [2021-11-17 02:18:57,078 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:18:57,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:18:57,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:18:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:18:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:18:57,079 INFO L87 Difference]: Start difference. First operand 8124 states and 10625 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 02:18:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:18:57,933 INFO L93 Difference]: Finished difference Result 24842 states and 33750 transitions. [2021-11-17 02:18:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:18:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 231 [2021-11-17 02:18:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:18:57,977 INFO L225 Difference]: With dead ends: 24842 [2021-11-17 02:18:57,977 INFO L226 Difference]: Without dead ends: 16737 [2021-11-17 02:18:57,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:18:57,998 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 357 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:18:57,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1963 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:18:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16737 states. [2021-11-17 02:18:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16737 to 10158. [2021-11-17 02:18:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10158 states, 7966 states have (on average 1.2493095656540296) internal successors, (9952), 7918 states have internal predecessors, (9952), 1660 states have call successors, (1660), 460 states have call predecessors, (1660), 531 states have return successors, (2091), 1851 states have call predecessors, (2091), 1659 states have call successors, (2091) [2021-11-17 02:18:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10158 states to 10158 states and 13703 transitions. [2021-11-17 02:18:58,771 INFO L78 Accepts]: Start accepts. Automaton has 10158 states and 13703 transitions. Word has length 231 [2021-11-17 02:18:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:18:58,771 INFO L470 AbstractCegarLoop]: Abstraction has 10158 states and 13703 transitions. [2021-11-17 02:18:58,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 02:18:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10158 states and 13703 transitions. [2021-11-17 02:18:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-11-17 02:18:58,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:18:58,790 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:58,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-17 02:18:59,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:18:59,004 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:18:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:18:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1104278262, now seen corresponding path program 1 times [2021-11-17 02:18:59,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:18:59,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308005367] [2021-11-17 02:18:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:18:59,005 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:18:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:18:59,007 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:18:59,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-17 02:18:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:18:59,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 02:18:59,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:18:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-17 02:18:59,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:19:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-17 02:19:00,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 02:19:00,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308005367] [2021-11-17 02:19:00,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308005367] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 02:19:00,435 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:19:00,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-17 02:19:00,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685126194] [2021-11-17 02:19:00,435 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 02:19:00,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 02:19:00,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 02:19:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 02:19:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:19:00,437 INFO L87 Difference]: Start difference. First operand 10158 states and 13703 transitions. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 02:19:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:19:01,079 INFO L93 Difference]: Finished difference Result 20369 states and 27459 transitions. [2021-11-17 02:19:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:19:01,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 231 [2021-11-17 02:19:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:19:01,112 INFO L225 Difference]: With dead ends: 20369 [2021-11-17 02:19:01,112 INFO L226 Difference]: Without dead ends: 10158 [2021-11-17 02:19:01,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:19:01,139 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 02:19:01,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1941 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 02:19:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2021-11-17 02:19:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 10158. [2021-11-17 02:19:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10158 states, 7966 states have (on average 1.2493095656540296) internal successors, (9952), 7918 states have internal predecessors, (9952), 1660 states have call successors, (1660), 460 states have call predecessors, (1660), 531 states have return successors, (2055), 1851 states have call predecessors, (2055), 1659 states have call successors, (2055) [2021-11-17 02:19:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10158 states to 10158 states and 13667 transitions. [2021-11-17 02:19:02,034 INFO L78 Accepts]: Start accepts. Automaton has 10158 states and 13667 transitions. Word has length 231 [2021-11-17 02:19:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:19:02,035 INFO L470 AbstractCegarLoop]: Abstraction has 10158 states and 13667 transitions. [2021-11-17 02:19:02,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 02:19:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10158 states and 13667 transitions. [2021-11-17 02:19:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-17 02:19:02,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:19:02,055 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:19:02,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-17 02:19:02,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 02:19:02,272 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:19:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:19:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash -587152558, now seen corresponding path program 1 times [2021-11-17 02:19:02,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 02:19:02,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557268046] [2021-11-17 02:19:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:19:02,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 02:19:02,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 02:19:02,275 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 02:19:02,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-17 02:19:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:19:04,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-17 02:19:04,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:19:04,563 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:19:04,596 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:19:05,073 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 13 treesize of output 10 [2021-11-17 02:19:06,348 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 20 treesize of output 19 [2021-11-17 02:19:06,351 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 19 treesize of output 16 [2021-11-17 02:19:06,503 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-17 02:19:06,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 39 [2021-11-17 02:19:06,523 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-17 02:19:06,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2021-11-17 02:19:07,050 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 02:19:07,051 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 43 treesize of output 39 [2021-11-17 02:19:13,296 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 14 treesize of output 11 [2021-11-17 02:20:46,001 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-17 02:20:46,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 68 [2021-11-17 02:20:52,153 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 02:20:52,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 61 [2021-11-17 02:20:54,448 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:22:23,744 INFO L354 Elim1Store]: treesize reduction 69, result has 34.9 percent of original size [2021-11-17 02:22:23,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 104 [2021-11-17 02:22:24,506 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-17 02:22:24,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 88 [2021-11-17 02:22:51,638 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-17 02:22:51,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 103 treesize of output 109 [2021-11-17 02:23:31,250 INFO L354 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2021-11-17 02:23:31,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2021-11-17 02:23:31,256 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 41 treesize of output 25 [2021-11-17 02:23:56,323 INFO L354 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2021-11-17 02:23:56,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2021-11-17 02:23:56,331 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 41 treesize of output 25 [2021-11-17 02:23:56,446 INFO L354 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2021-11-17 02:23:56,446 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 57 treesize of output 60 [2021-11-17 02:23:56,477 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-17 02:23:56,477 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 54 treesize of output 42 Killed by 15