./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:10:51,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:10:51,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:10:51,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:10:51,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:10:51,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:10:51,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:10:51,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:10:51,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:10:51,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:10:51,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:10:51,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:10:51,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:10:51,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:10:51,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:10:51,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:10:51,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:10:51,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:10:51,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:10:51,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:10:51,866 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:10:51,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:10:51,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:10:51,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:10:51,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:10:51,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:10:51,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:10:51,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:10:51,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:10:51,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:10:51,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:10:51,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:10:51,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:10:51,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:10:51,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:10:51,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:10:51,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:10:51,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:10:51,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:10:51,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:10:51,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:10:51,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:10:51,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:10:51,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:10:51,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:10:51,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:10:51,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:10:51,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:10:51,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:10:51,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:10:51,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:10:51,926 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:10:51,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:10:51,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:10:51,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:10:51,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:10:51,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:10:51,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:10:51,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:10:51,928 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:10:51,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:10:51,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:10:51,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:10:51,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:10:51,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:10:51,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:10:51,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:10:51,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:10:51,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:10:51,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:10:51,932 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:10:51,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:10:51,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:10:51,932 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 -> 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa [2022-07-12 13:10:52,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:10:52,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:10:52,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:10:52,187 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:10:52,187 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:10:52,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-12 13:10:52,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361dcf5da/cd605de0e46d4f6b9afb2353bff0c363/FLAGe50a7e606 [2022-07-12 13:10:52,803 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:10:52,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-12 13:10:52,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361dcf5da/cd605de0e46d4f6b9afb2353bff0c363/FLAGe50a7e606 [2022-07-12 13:10:53,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361dcf5da/cd605de0e46d4f6b9afb2353bff0c363 [2022-07-12 13:10:53,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:10:53,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:10:53,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:10:53,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:10:53,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:10:53,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:10:53" (1/1) ... [2022-07-12 13:10:53,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1462006c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:53, skipping insertion in model container [2022-07-12 13:10:53,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:10:53" (1/1) ... [2022-07-12 13:10:53,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:10:53,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:10:53,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-12 13:10:53,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:10:53,867 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:10:54,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-12 13:10:54,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:10:54,145 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:10:54,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54 WrapperNode [2022-07-12 13:10:54,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:10:54,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:10:54,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:10:54,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:10:54,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,245 INFO L137 Inliner]: procedures = 114, calls = 417, calls flagged for inlining = 49, calls inlined = 46, statements flattened = 1211 [2022-07-12 13:10:54,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:10:54,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:10:54,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:10:54,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:10:54,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:10:54,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:10:54,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:10:54,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:10:54,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (1/1) ... [2022-07-12 13:10:54,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:10:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:10:54,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:10:54,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:10:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure raw_open [2022-07-12 13:10:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_open [2022-07-12 13:10:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-12 13:10:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-12 13:10:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:10:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:10:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:10:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:10:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:10:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_read_iter [2022-07-12 13:10:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_read_iter [2022-07-12 13:10:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:10:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:10:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-12 13:10:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-12 13:10:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure bind_get [2022-07-12 13:10:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_get [2022-07-12 13:10:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:10:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 13:10:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 13:10:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 13:10:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 13:10:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:10:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:10:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:10:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:10:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure bind_set [2022-07-12 13:10:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_set [2022-07-12 13:10:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-12 13:10:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-12 13:10:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:10:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:10:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:10:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:10:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:10:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-12 13:10:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-12 13:10:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 13:10:54,466 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 13:10:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:10:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:10:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:10:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:10:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 13:10:54,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 13:10:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-12 13:10:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-12 13:10:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:10:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:10:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_fsync [2022-07-12 13:10:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_fsync [2022-07-12 13:10:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2022-07-12 13:10:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2022-07-12 13:10:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-12 13:10:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-12 13:10:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-12 13:10:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-12 13:10:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 13:10:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 13:10:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_write_iter [2022-07-12 13:10:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_write_iter [2022-07-12 13:10:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:10:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:10:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:10:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 13:10:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 13:10:54,746 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:10:54,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:10:54,974 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:10:55,574 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:10:55,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:10:55,589 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:10:55,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:10:55 BoogieIcfgContainer [2022-07-12 13:10:55,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:10:55,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:10:55,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:10:55,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:10:55,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:10:53" (1/3) ... [2022-07-12 13:10:55,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eec391e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:10:55, skipping insertion in model container [2022-07-12 13:10:55,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:10:54" (2/3) ... [2022-07-12 13:10:55,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eec391e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:10:55, skipping insertion in model container [2022-07-12 13:10:55,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:10:55" (3/3) ... [2022-07-12 13:10:55,600 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-12 13:10:55,612 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:10:55,612 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:10:55,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:10:55,687 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30ece796, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68804bd6 [2022-07-12 13:10:55,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:10:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-12 13:10:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 13:10:55,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:10:55,722 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:10:55,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:10:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:10:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -837597320, now seen corresponding path program 1 times [2022-07-12 13:10:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:10:55,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169387339] [2022-07-12 13:10:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:10:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:10:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:10:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:10:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:10:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:10:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:10:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:10:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:10:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:10:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:10:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:10:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:10:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:10:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:10:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:10:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:10:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:10:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 13:10:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 13:10:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 13:10:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 13:10:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:10:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169387339] [2022-07-12 13:10:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169387339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:10:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:10:56,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:10:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747703032] [2022-07-12 13:10:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:10:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:10:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:10:56,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:10:56,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:10:56,720 INFO L87 Difference]: Start difference. First operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 13:10:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:10:57,869 INFO L93 Difference]: Finished difference Result 1122 states and 1580 transitions. [2022-07-12 13:10:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:10:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2022-07-12 13:10:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:10:57,887 INFO L225 Difference]: With dead ends: 1122 [2022-07-12 13:10:57,888 INFO L226 Difference]: Without dead ends: 726 [2022-07-12 13:10:57,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:10:57,898 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 879 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:10:57,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1535 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 13:10:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-12 13:10:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 661. [2022-07-12 13:10:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3394683026584866) internal successors, (655), 493 states have internal predecessors, (655), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-12 13:10:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 897 transitions. [2022-07-12 13:10:58,038 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 897 transitions. Word has length 178 [2022-07-12 13:10:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:10:58,039 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 897 transitions. [2022-07-12 13:10:58,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 13:10:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 897 transitions. [2022-07-12 13:10:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 13:10:58,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:10:58,043 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:10:58,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:10:58,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:10:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:10:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 210178479, now seen corresponding path program 1 times [2022-07-12 13:10:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:10:58,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617926711] [2022-07-12 13:10:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:10:58,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:10:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:10:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:10:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:10:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:10:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:10:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:10:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:10:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:10:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:10:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:10:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:10:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:10:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:10:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:10:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:10:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:10:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:10:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 13:10:58,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:10:58,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617926711] [2022-07-12 13:10:58,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617926711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:10:58,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:10:58,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:10:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712130020] [2022-07-12 13:10:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:10:58,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:10:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:10:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:10:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:10:58,499 INFO L87 Difference]: Start difference. First operand 661 states and 897 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 13:10:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:10:59,159 INFO L93 Difference]: Finished difference Result 1368 states and 1876 transitions. [2022-07-12 13:10:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:10:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 177 [2022-07-12 13:10:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:10:59,166 INFO L225 Difference]: With dead ends: 1368 [2022-07-12 13:10:59,167 INFO L226 Difference]: Without dead ends: 757 [2022-07-12 13:10:59,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:10:59,171 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 724 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:10:59,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1291 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:10:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-12 13:10:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 661. [2022-07-12 13:10:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3374233128834356) internal successors, (654), 493 states have internal predecessors, (654), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-12 13:10:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 896 transitions. [2022-07-12 13:10:59,255 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 896 transitions. Word has length 177 [2022-07-12 13:10:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:10:59,257 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 896 transitions. [2022-07-12 13:10:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 13:10:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 896 transitions. [2022-07-12 13:10:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 13:10:59,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:10:59,263 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:10:59,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:10:59,263 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:10:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:10:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1478765263, now seen corresponding path program 1 times [2022-07-12 13:10:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:10:59,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533018160] [2022-07-12 13:10:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:10:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:10:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:10:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:10:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:10:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:10:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:10:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:10:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:10:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:10:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:10:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:10:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:10:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:10:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:10:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:10:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:10:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:10:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:10:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:10:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:10:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:10:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 13:10:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:10:59,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533018160] [2022-07-12 13:10:59,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533018160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:10:59,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:10:59,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:10:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878585881] [2022-07-12 13:10:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:10:59,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:10:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:10:59,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:10:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:10:59,640 INFO L87 Difference]: Start difference. First operand 661 states and 896 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 13:11:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:00,711 INFO L93 Difference]: Finished difference Result 2068 states and 2847 transitions. [2022-07-12 13:11:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:11:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 177 [2022-07-12 13:11:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:00,719 INFO L225 Difference]: With dead ends: 2068 [2022-07-12 13:11:00,719 INFO L226 Difference]: Without dead ends: 1441 [2022-07-12 13:11:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:11:00,722 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 1029 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:00,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1472 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 13:11:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-07-12 13:11:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1253. [2022-07-12 13:11:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 936 states have (on average 1.3461538461538463) internal successors, (1260), 945 states have internal predecessors, (1260), 221 states have call successors, (221), 94 states have call predecessors, (221), 95 states have return successors, (227), 219 states have call predecessors, (227), 219 states have call successors, (227) [2022-07-12 13:11:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1708 transitions. [2022-07-12 13:11:00,794 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1708 transitions. Word has length 177 [2022-07-12 13:11:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:00,795 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1708 transitions. [2022-07-12 13:11:00,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 13:11:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1708 transitions. [2022-07-12 13:11:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-12 13:11:00,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:00,799 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:11:00,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1465783967, now seen corresponding path program 1 times [2022-07-12 13:11:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260035401] [2022-07-12 13:11:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 13:11:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 13:11:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 13:11:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:01,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260035401] [2022-07-12 13:11:01,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260035401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:01,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:11:01,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:11:01,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393065191] [2022-07-12 13:11:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:01,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:11:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:11:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:11:01,035 INFO L87 Difference]: Start difference. First operand 1253 states and 1708 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 13:11:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:01,806 INFO L93 Difference]: Finished difference Result 3258 states and 4422 transitions. [2022-07-12 13:11:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:11:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 200 [2022-07-12 13:11:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:01,816 INFO L225 Difference]: With dead ends: 3258 [2022-07-12 13:11:01,816 INFO L226 Difference]: Without dead ends: 2055 [2022-07-12 13:11:01,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:11:01,820 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 664 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:01,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:11:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-07-12 13:11:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1833. [2022-07-12 13:11:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1376 states have (on average 1.340843023255814) internal successors, (1845), 1388 states have internal predecessors, (1845), 310 states have call successors, (310), 145 states have call predecessors, (310), 146 states have return successors, (316), 307 states have call predecessors, (316), 308 states have call successors, (316) [2022-07-12 13:11:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2471 transitions. [2022-07-12 13:11:01,909 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2471 transitions. Word has length 200 [2022-07-12 13:11:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:01,909 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2471 transitions. [2022-07-12 13:11:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 13:11:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2471 transitions. [2022-07-12 13:11:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 13:11:01,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:01,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:11:01,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1995507625, now seen corresponding path program 1 times [2022-07-12 13:11:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:01,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939616269] [2022-07-12 13:11:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:11:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 13:11:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 13:11:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 13:11:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-12 13:11:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939616269] [2022-07-12 13:11:02,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939616269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:02,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:11:02,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:11:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304765613] [2022-07-12 13:11:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:02,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:11:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:11:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:11:02,235 INFO L87 Difference]: Start difference. First operand 1833 states and 2471 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 13:11:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:02,928 INFO L93 Difference]: Finished difference Result 3196 states and 4288 transitions. [2022-07-12 13:11:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:11:02,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 267 [2022-07-12 13:11:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:02,936 INFO L225 Difference]: With dead ends: 3196 [2022-07-12 13:11:02,936 INFO L226 Difference]: Without dead ends: 1411 [2022-07-12 13:11:02,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:11:02,940 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 325 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:02,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1445 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:11:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-12 13:11:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1215. [2022-07-12 13:11:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 898 states have (on average 1.3140311804008908) internal successors, (1180), 907 states have internal predecessors, (1180), 211 states have call successors, (211), 105 states have call predecessors, (211), 105 states have return successors, (213), 208 states have call predecessors, (213), 209 states have call successors, (213) [2022-07-12 13:11:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1604 transitions. [2022-07-12 13:11:02,992 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1604 transitions. Word has length 267 [2022-07-12 13:11:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:02,993 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1604 transitions. [2022-07-12 13:11:02,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 13:11:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1604 transitions. [2022-07-12 13:11:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 13:11:02,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:02,997 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:11:02,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1551606951, now seen corresponding path program 1 times [2022-07-12 13:11:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:02,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673474954] [2022-07-12 13:11:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:11:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 13:11:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 13:11:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 13:11:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-12 13:11:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:03,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673474954] [2022-07-12 13:11:03,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673474954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:03,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:11:03,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:11:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771401881] [2022-07-12 13:11:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:03,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:11:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:11:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:11:03,351 INFO L87 Difference]: Start difference. First operand 1215 states and 1604 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 13:11:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:04,258 INFO L93 Difference]: Finished difference Result 2898 states and 3833 transitions. [2022-07-12 13:11:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:11:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 267 [2022-07-12 13:11:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:04,267 INFO L225 Difference]: With dead ends: 2898 [2022-07-12 13:11:04,267 INFO L226 Difference]: Without dead ends: 1848 [2022-07-12 13:11:04,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:11:04,271 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 667 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:04,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1904 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 13:11:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-07-12 13:11:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1575. [2022-07-12 13:11:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1174 states have (on average 1.3160136286201023) internal successors, (1545), 1183 states have internal predecessors, (1545), 263 states have call successors, (263), 137 states have call predecessors, (263), 137 states have return successors, (265), 260 states have call predecessors, (265), 261 states have call successors, (265) [2022-07-12 13:11:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2073 transitions. [2022-07-12 13:11:04,394 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2073 transitions. Word has length 267 [2022-07-12 13:11:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:04,394 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2073 transitions. [2022-07-12 13:11:04,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 13:11:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2073 transitions. [2022-07-12 13:11:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-12 13:11:04,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:04,399 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:04,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:11:04,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -350932392, now seen corresponding path program 1 times [2022-07-12 13:11:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853302908] [2022-07-12 13:11:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:11:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 13:11:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-12 13:11:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-12 13:11:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-12 13:11:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-07-12 13:11:04,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:04,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853302908] [2022-07-12 13:11:04,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853302908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:04,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:11:04,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 13:11:04,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440773245] [2022-07-12 13:11:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 13:11:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:04,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 13:11:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:11:04,840 INFO L87 Difference]: Start difference. First operand 1575 states and 2073 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 13:11:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:06,703 INFO L93 Difference]: Finished difference Result 4803 states and 6330 transitions. [2022-07-12 13:11:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 13:11:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 286 [2022-07-12 13:11:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:06,720 INFO L225 Difference]: With dead ends: 4803 [2022-07-12 13:11:06,720 INFO L226 Difference]: Without dead ends: 3393 [2022-07-12 13:11:06,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-12 13:11:06,725 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 823 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:06,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3980 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 13:11:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-12 13:11:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2675. [2022-07-12 13:11:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2007 states have (on average 1.3248629795714997) internal successors, (2659), 2026 states have internal predecessors, (2659), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-12 13:11:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3541 transitions. [2022-07-12 13:11:06,893 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3541 transitions. Word has length 286 [2022-07-12 13:11:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:06,894 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3541 transitions. [2022-07-12 13:11:06,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 13:11:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3541 transitions. [2022-07-12 13:11:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-12 13:11:06,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:06,902 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:06,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:11:06,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash 311520253, now seen corresponding path program 1 times [2022-07-12 13:11:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:06,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818367095] [2022-07-12 13:11:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:11:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:11:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:11:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 13:11:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 13:11:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-12 13:11:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-12 13:11:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2022-07-12 13:11:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818367095] [2022-07-12 13:11:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818367095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:07,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:11:07,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:11:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784526211] [2022-07-12 13:11:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:07,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:11:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:11:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:11:07,413 INFO L87 Difference]: Start difference. First operand 2675 states and 3541 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 13:11:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:08,272 INFO L93 Difference]: Finished difference Result 5643 states and 7511 transitions. [2022-07-12 13:11:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:11:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 306 [2022-07-12 13:11:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:08,287 INFO L225 Difference]: With dead ends: 5643 [2022-07-12 13:11:08,288 INFO L226 Difference]: Without dead ends: 3133 [2022-07-12 13:11:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:11:08,293 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 467 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1646 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:11:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-07-12 13:11:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2703. [2022-07-12 13:11:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2035 states have (on average 1.3282555282555282) internal successors, (2703), 2054 states have internal predecessors, (2703), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-12 13:11:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3585 transitions. [2022-07-12 13:11:08,441 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3585 transitions. Word has length 306 [2022-07-12 13:11:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:08,442 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 3585 transitions. [2022-07-12 13:11:08,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 13:11:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3585 transitions. [2022-07-12 13:11:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-12 13:11:08,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:08,449 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:11:08,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1101263580, now seen corresponding path program 1 times [2022-07-12 13:11:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:08,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897631023] [2022-07-12 13:11:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:11:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:11:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:11:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 13:11:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 13:11:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 13:11:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-12 13:11:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-07-12 13:11:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:08,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897631023] [2022-07-12 13:11:08,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897631023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:11:08,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171344342] [2022-07-12 13:11:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:08,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:11:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:11:08,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:11:08,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:11:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:09,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2457 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 13:11:09,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:11:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-12 13:11:09,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:11:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171344342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:09,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:11:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-12 13:11:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921141917] [2022-07-12 13:11:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:11:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:11:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:11:09,568 INFO L87 Difference]: Start difference. First operand 2703 states and 3585 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-12 13:11:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:09,704 INFO L93 Difference]: Finished difference Result 4225 states and 5561 transitions. [2022-07-12 13:11:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:11:09,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 305 [2022-07-12 13:11:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:09,712 INFO L225 Difference]: With dead ends: 4225 [2022-07-12 13:11:09,712 INFO L226 Difference]: Without dead ends: 1646 [2022-07-12 13:11:09,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:11:09,718 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 20 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:09,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2015 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:11:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-07-12 13:11:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1547. [2022-07-12 13:11:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1152 states have (on average 1.3159722222222223) internal successors, (1516), 1164 states have internal predecessors, (1516), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-12 13:11:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2022-07-12 13:11:09,807 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 305 [2022-07-12 13:11:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:09,809 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2022-07-12 13:11:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-12 13:11:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2022-07-12 13:11:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-12 13:11:09,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:09,815 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:09,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 13:11:10,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:11:10,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:10,040 INFO L85 PathProgramCache]: Analyzing trace with hash -191141444, now seen corresponding path program 1 times [2022-07-12 13:11:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:10,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357715513] [2022-07-12 13:11:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 13:11:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:11:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:11:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:11:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:11:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:11:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:11:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:11:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:11:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:11:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:11:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:11:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:11:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:11:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 13:11:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 13:11:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-12 13:11:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 13:11:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 13:11:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-12 13:11:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2022-07-12 13:11:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:10,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357715513] [2022-07-12 13:11:10,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357715513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:11:10,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24941728] [2022-07-12 13:11:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:10,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:11:10,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:11:10,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:11:10,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:11:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 13:11:11,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:11:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-07-12 13:11:11,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:11:11,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24941728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:11:11,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:11:11,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-12 13:11:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108856606] [2022-07-12 13:11:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:11:11,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:11:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:11:11,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:11:11,251 INFO L87 Difference]: Start difference. First operand 1547 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 13:11:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:11:11,360 INFO L93 Difference]: Finished difference Result 3072 states and 4060 transitions. [2022-07-12 13:11:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:11:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 317 [2022-07-12 13:11:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:11:11,367 INFO L225 Difference]: With dead ends: 3072 [2022-07-12 13:11:11,367 INFO L226 Difference]: Without dead ends: 1548 [2022-07-12 13:11:11,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:11:11,371 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 3 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:11:11,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:11:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-12 13:11:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2022-07-12 13:11:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1153 states have (on average 1.3156981786643538) internal successors, (1517), 1165 states have internal predecessors, (1517), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-12 13:11:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2038 transitions. [2022-07-12 13:11:11,447 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2038 transitions. Word has length 317 [2022-07-12 13:11:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:11:11,448 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2038 transitions. [2022-07-12 13:11:11,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 13:11:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2038 transitions. [2022-07-12 13:11:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-12 13:11:11,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:11:11,453 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:11:11,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 13:11:11,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 13:11:11,673 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:11:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:11:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 931062163, now seen corresponding path program 1 times [2022-07-12 13:11:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:11:11,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342893282] [2022-07-12 13:11:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:11:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:11:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:11:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:11:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:11:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:11:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:11:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 13:11:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 13:11:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 13:11:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 13:11:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:11:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 13:11:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 13:11:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 13:11:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:11:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 13:11:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:11:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:11:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:11:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 13:11:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 13:11:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:11:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 13:11:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-12 13:11:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 13:11:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-12 13:11:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:11:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:11:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-12 13:11:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2022-07-12 13:11:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:11:12,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342893282] [2022-07-12 13:11:12,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342893282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:11:12,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432319455] [2022-07-12 13:11:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:11:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:11:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:11:12,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:11:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:11:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:11:13,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 319 conjunts are in the unsatisfiable core [2022-07-12 13:11:13,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:11:13,241 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-12 13:11:13,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 262 treesize of output 244 [2022-07-12 13:11:15,376 INFO L390 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 11 treesize of output 7 [2022-07-12 13:11:16,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:16,090 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2251 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2251) |c_#memory_int|))) is different from true [2022-07-12 13:11:16,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:16,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:16,733 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2252 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2252) |c_#memory_int|))) is different from true [2022-07-12 13:11:16,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:17,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:17,053 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2253 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2253) |c_#memory_int|))) is different from true [2022-07-12 13:11:17,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:17,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:17,322 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2254 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2254)))) is different from true [2022-07-12 13:11:17,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:17,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:31,766 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 13:11:31,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 13:11:33,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:33,975 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2257 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2257) |c_#memory_int|))) is different from true [2022-07-12 13:11:34,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:35,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:35,384 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 13:11:35,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 13:11:37,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:37,530 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2260 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2260)))) is different from true [2022-07-12 13:11:37,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:39,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:39,650 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2261 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2261) |c_#memory_int|))) is different from true [2022-07-12 13:11:39,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:40,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:40,674 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2262 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2262) |c_#memory_int|))) is different from true [2022-07-12 13:11:40,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:41,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:41,602 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2263 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2263) |c_#memory_int|))) is different from true [2022-07-12 13:11:41,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:44,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:45,276 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2264) |c_#memory_int|))) is different from true [2022-07-12 13:11:45,290 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| v_ArrVal_2264)) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| |c_#StackHeapBarrier|)))) is different from true [2022-07-12 13:11:45,300 INFO L390 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 6 treesize of output 5 [2022-07-12 13:11:45,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:11:45,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:45,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:45,358 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2265 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2265) |c_#memory_int|))) is different from true [2022-07-12 13:11:47,427 INFO L390 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 6 treesize of output 5 [2022-07-12 13:11:48,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:11:48,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:48,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:11:48,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:48,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:11:48,735 WARN L855 $PredicateComparison]: unable to prove that (exists ((|raw_open_~filp#1.base| Int)) (and (<= |raw_open_~filp#1.base| |c_raw_open_#in~filp#1.base|) (exists ((v_ArrVal_2267 (Array Int Int))) (= (store |c_old(#memory_int)| |raw_open_~filp#1.base| v_ArrVal_2267) |c_#memory_int|)))) is different from true [2022-07-12 13:11:48,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:11:48,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:11:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 87 proven. 101 refuted. 10 times theorem prover too weak. 223 trivial. 403 not checked. [2022-07-12 13:11:48,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:11:48,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2270 (Array Int Int)) (|v_raw_open_~filp#1.base_10| Int)) (or (< c_~raw_ctl_fops_group2~0.base |v_raw_open_~filp#1.base_10|) (not (= (select (select (store |c_#memory_int| |v_raw_open_~filp#1.base_10| v_ArrVal_2270) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032)))) is different from false [2022-07-12 13:11:48,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432319455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:11:48,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:11:48,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 52] total 59 [2022-07-12 13:11:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536976018] [2022-07-12 13:11:48,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:11:48,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 13:11:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:11:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 13:11:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1896, Unknown=39, NotChecked=1442, Total=3660 [2022-07-12 13:11:48,951 INFO L87 Difference]: Start difference. First operand 1548 states and 2038 transitions. Second operand has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-12 13:12:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:03,834 INFO L93 Difference]: Finished difference Result 3342 states and 4415 transitions. [2022-07-12 13:12:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 13:12:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) Word has length 331 [2022-07-12 13:12:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:03,843 INFO L225 Difference]: With dead ends: 3342 [2022-07-12 13:12:03,844 INFO L226 Difference]: Without dead ends: 1820 [2022-07-12 13:12:03,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 420 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=450, Invalid=3697, Unknown=69, NotChecked=1946, Total=6162 [2022-07-12 13:12:03,849 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 377 mSDsluCounter, 5840 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 11950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8947 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:03,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 6292 Invalid, 11950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2760 Invalid, 0 Unknown, 8947 Unchecked, 1.9s Time] [2022-07-12 13:12:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-07-12 13:12:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1558. [2022-07-12 13:12:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1161 states have (on average 1.3152454780361758) internal successors, (1527), 1174 states have internal predecessors, (1527), 257 states have call successors, (257), 134 states have call predecessors, (257), 139 states have return successors, (271), 252 states have call predecessors, (271), 255 states have call successors, (271) [2022-07-12 13:12:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2055 transitions. [2022-07-12 13:12:03,941 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2055 transitions. Word has length 331 [2022-07-12 13:12:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:03,942 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 2055 transitions. [2022-07-12 13:12:03,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-12 13:12:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2055 transitions. [2022-07-12 13:12:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-07-12 13:12:03,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:03,948 INFO L195 NwaCegarLoop]: trace histogram [17, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:03,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:04,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:04,163 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1184488591, now seen corresponding path program 1 times [2022-07-12 13:12:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418102915] [2022-07-12 13:12:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:12:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:12:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:12:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:12:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 13:12:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 13:12:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 13:12:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 13:12:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:12:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:12:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 13:12:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 13:12:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:12:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 13:12:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:12:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 13:12:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:12:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:12:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 13:12:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 13:12:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-12 13:12:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 13:12:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-12 13:12:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-12 13:12:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:12:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-12 13:12:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2022-07-12 13:12:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418102915] [2022-07-12 13:12:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418102915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:04,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694182443] [2022-07-12 13:12:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:04,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:04,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:04,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:12:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:05,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 13:12:05,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 351 proven. 6 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-07-12 13:12:05,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:12:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 9 proven. 79 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2022-07-12 13:12:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694182443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:12:06,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:12:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 5] total 19 [2022-07-12 13:12:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889450881] [2022-07-12 13:12:06,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:12:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 13:12:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:12:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 13:12:06,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-07-12 13:12:06,135 INFO L87 Difference]: Start difference. First operand 1558 states and 2055 transitions. Second operand has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-12 13:12:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:07,575 INFO L93 Difference]: Finished difference Result 3344 states and 4429 transitions. [2022-07-12 13:12:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 13:12:07,576 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 334 [2022-07-12 13:12:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:07,584 INFO L225 Difference]: With dead ends: 3344 [2022-07-12 13:12:07,584 INFO L226 Difference]: Without dead ends: 1803 [2022-07-12 13:12:07,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 13:12:07,588 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 639 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:07,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 3237 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 13:12:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-12 13:12:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1559. [2022-07-12 13:12:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1163 states have (on average 1.3138435081685296) internal successors, (1528), 1175 states have internal predecessors, (1528), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-12 13:12:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2049 transitions. [2022-07-12 13:12:07,670 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2049 transitions. Word has length 334 [2022-07-12 13:12:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:07,670 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2049 transitions. [2022-07-12 13:12:07,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-12 13:12:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2049 transitions. [2022-07-12 13:12:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-12 13:12:07,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:07,677 INFO L195 NwaCegarLoop]: trace histogram [43, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:07,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:07,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:07,904 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash 943002118, now seen corresponding path program 2 times [2022-07-12 13:12:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:07,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505483510] [2022-07-12 13:12:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:12:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:12:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:12:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:12:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 13:12:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:12:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 13:12:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 13:12:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 13:12:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 13:12:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 13:12:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 13:12:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 13:12:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 13:12:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 13:12:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 13:12:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:12:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:12:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-12 13:12:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-12 13:12:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-12 13:12:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-12 13:12:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-12 13:12:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-12 13:12:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:12:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-12 13:12:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2022-07-12 13:12:08,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:08,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505483510] [2022-07-12 13:12:08,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505483510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:08,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531580267] [2022-07-12 13:12:08,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:12:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:08,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:08,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 13:12:09,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 13:12:09,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:12:09,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 13:12:09,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 392 proven. 6 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2022-07-12 13:12:09,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:12:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2022-07-12 13:12:10,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531580267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:12:10,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:12:10,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2022-07-12 13:12:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496334123] [2022-07-12 13:12:10,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:12:10,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 13:12:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:12:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 13:12:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-12 13:12:10,020 INFO L87 Difference]: Start difference. First operand 1559 states and 2049 transitions. Second operand has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-12 13:12:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:11,467 INFO L93 Difference]: Finished difference Result 3341 states and 4411 transitions. [2022-07-12 13:12:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 13:12:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 362 [2022-07-12 13:12:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:11,476 INFO L225 Difference]: With dead ends: 3341 [2022-07-12 13:12:11,476 INFO L226 Difference]: Without dead ends: 1805 [2022-07-12 13:12:11,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 13:12:11,481 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 375 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:11,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2568 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 13:12:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-12 13:12:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1560. [2022-07-12 13:12:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1164 states have (on average 1.313573883161512) internal successors, (1529), 1176 states have internal predecessors, (1529), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-12 13:12:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2050 transitions. [2022-07-12 13:12:11,562 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2050 transitions. Word has length 362 [2022-07-12 13:12:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:11,562 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 2050 transitions. [2022-07-12 13:12:11,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-12 13:12:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2050 transitions. [2022-07-12 13:12:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-07-12 13:12:11,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:11,566 INFO L195 NwaCegarLoop]: trace histogram [48, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:11,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:11,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 13:12:11,791 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -298770021, now seen corresponding path program 3 times [2022-07-12 13:12:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057302273] [2022-07-12 13:12:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:12:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:12:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:12:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:12:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:12:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:12:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 13:12:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:12:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 13:12:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 13:12:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:12:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:12:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 13:12:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 13:12:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 13:12:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 13:12:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:12:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:12:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 13:12:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 13:12:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 13:12:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-12 13:12:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-12 13:12:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-12 13:12:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:12:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-12 13:12:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 28 proven. 290 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2022-07-12 13:12:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057302273] [2022-07-12 13:12:12,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057302273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055385573] [2022-07-12 13:12:12,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 13:12:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:12,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:12,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:12,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 13:12:15,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-12 13:12:15,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:12:15,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 13:12:15,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 452 proven. 10 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2022-07-12 13:12:15,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:12:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 308 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2022-07-12 13:12:15,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055385573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:12:15,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:12:15,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2022-07-12 13:12:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773108587] [2022-07-12 13:12:15,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:12:15,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 13:12:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:12:15,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 13:12:15,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-07-12 13:12:15,604 INFO L87 Difference]: Start difference. First operand 1560 states and 2050 transitions. Second operand has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-12 13:12:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:12:17,163 INFO L93 Difference]: Finished difference Result 3342 states and 4418 transitions. [2022-07-12 13:12:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 13:12:17,163 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 367 [2022-07-12 13:12:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:12:17,170 INFO L225 Difference]: With dead ends: 3342 [2022-07-12 13:12:17,170 INFO L226 Difference]: Without dead ends: 1802 [2022-07-12 13:12:17,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 13:12:17,174 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 216 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:12:17,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 3506 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 13:12:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-07-12 13:12:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1564. [2022-07-12 13:12:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1168 states have (on average 1.3116438356164384) internal successors, (1532), 1180 states have internal predecessors, (1532), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-12 13:12:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2053 transitions. [2022-07-12 13:12:17,256 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2053 transitions. Word has length 367 [2022-07-12 13:12:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:12:17,256 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 2053 transitions. [2022-07-12 13:12:17,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-12 13:12:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2053 transitions. [2022-07-12 13:12:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-07-12 13:12:17,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:12:17,261 INFO L195 NwaCegarLoop]: trace histogram [76, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:12:17,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:12:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:17,476 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:12:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:12:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 750840027, now seen corresponding path program 4 times [2022-07-12 13:12:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:12:17,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289741889] [2022-07-12 13:12:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:12:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:12:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:12:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:12:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:12:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:12:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:12:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 13:12:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:12:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:12:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 13:12:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:12:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 13:12:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 13:12:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 13:12:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 13:12:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 13:12:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 13:12:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:12:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 13:12:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:12:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 13:12:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-12 13:12:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:12:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-12 13:12:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-12 13:12:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-07-12 13:12:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-07-12 13:12:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:12:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 13:12:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-12 13:12:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:12:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 451 proven. 879 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2022-07-12 13:12:22,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:12:22,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289741889] [2022-07-12 13:12:22,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289741889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:12:22,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301232390] [2022-07-12 13:12:22,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 13:12:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:12:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:12:22,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:12:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 13:12:23,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 13:12:23,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:12:23,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 432 conjunts are in the unsatisfiable core [2022-07-12 13:12:23,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:12:23,410 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-12 13:12:23,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 258 treesize of output 240 [2022-07-12 13:12:25,960 INFO L390 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 14 treesize of output 10 [2022-07-12 13:12:26,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:12:26,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 13:12:26,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:12:26,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 13:12:26,112 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 13:12:26,113 INFO L390 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 21 treesize of output 20 [2022-07-12 13:12:26,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:27,125 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6844 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6844)))) is different from true [2022-07-12 13:12:27,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:12:27,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:27,908 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6852 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6852) |c_#memory_int|))) is different from true [2022-07-12 13:12:28,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:12:28,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:28,637 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6860 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6860) |c_#memory_int|))) is different from true [2022-07-12 13:12:28,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:12:28,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:55,895 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 13:12:55,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2022-07-12 13:12:57,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:58,280 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6876 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6876) |c_#memory_int|))) is different from true [2022-07-12 13:12:58,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:12:59,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:12:59,908 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6880 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6880) |c_#memory_int|))) is different from true [2022-07-12 13:12:59,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:01,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:02,024 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6888 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6888)))) is different from true [2022-07-12 13:13:02,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:03,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:04,133 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6896 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6896) |c_#memory_int|))) is different from true [2022-07-12 13:13:04,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:05,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:40,465 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 13:13:40,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2022-07-12 13:13:42,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:42,189 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6908 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6908) |c_#memory_int|))) is different from true [2022-07-12 13:13:42,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:43,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:44,265 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6916 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6916) |c_#memory_int|))) is different from true [2022-07-12 13:13:44,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:50,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:51,931 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6917 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_6917) |c_#memory_int|))) is different from true [2022-07-12 13:13:51,941 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| Int) (v_ArrVal_6917 (Array Int Int))) (and (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| v_ArrVal_6917) |c_#memory_int|) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| |c_#StackHeapBarrier|)))) is different from true [2022-07-12 13:13:51,947 INFO L390 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 6 treesize of output 5 [2022-07-12 13:13:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:13:51,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:51,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:51,996 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6918 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_6918)))) is different from true [2022-07-12 13:13:54,780 INFO L390 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 6 treesize of output 5 [2022-07-12 13:13:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:13:56,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:57,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:13:57,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:57,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 13:13:57,259 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6920 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_raw_open_#in~filp#1.base| v_ArrVal_6920))) is different from true [2022-07-12 13:13:57,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:13:57,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 13:13:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 249 proven. 1107 refuted. 333 times theorem prover too weak. 1708 trivial. 979 not checked. [2022-07-12 13:13:57,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:13:57,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6923 (Array Int Int))) (not (= (select (select (store |c_#memory_int| c_~raw_ctl_fops_group2~0.base v_ArrVal_6923) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032))) is different from false [2022-07-12 13:13:57,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301232390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:13:57,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:13:57,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 66] total 110 [2022-07-12 13:13:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522751502] [2022-07-12 13:13:57,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:13:57,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-12 13:13:57,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:13:57,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-12 13:13:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=9224, Unknown=89, NotChecked=2954, Total=13110 [2022-07-12 13:13:57,698 INFO L87 Difference]: Start difference. First operand 1564 states and 2053 transitions. Second operand has 110 states, 108 states have (on average 3.0) internal successors, (324), 98 states have internal predecessors, (324), 42 states have call successors, (75), 12 states have call predecessors, (75), 30 states have return successors, (73), 45 states have call predecessors, (73), 42 states have call successors, (73) [2022-07-12 13:14:23,249 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6916 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6916) |c_#memory_int|)) (exists ((v_ArrVal_6876 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6876) |c_#memory_int|)) (exists ((v_ArrVal_6888 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6888))) (exists ((v_ArrVal_6860 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6860) |c_#memory_int|)) (exists ((v_ArrVal_6844 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6844))) (exists ((v_ArrVal_6896 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6896) |c_#memory_int|)) (exists ((v_ArrVal_6852 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6852) |c_#memory_int|)) (exists ((v_ArrVal_6880 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6880) |c_#memory_int|)) (exists ((v_ArrVal_6903 Int) (v_ArrVal_6902 Int) (v_ArrVal_6899 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| (store (store (store (store (select |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base|) |c_ldv_memset_#in~s#1.offset| |c_ldv_memset_#in~c#1|) (+ |c_ldv_memset_#in~s#1.offset| 1) v_ArrVal_6899) (+ |c_ldv_memset_#in~s#1.offset| 2) v_ArrVal_6902) (+ |c_ldv_memset_#in~s#1.offset| 3) v_ArrVal_6903)))) (exists ((v_ArrVal_6908 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6908) |c_#memory_int|))) is different from true