./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 35987657 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-?-3598765 [2022-07-21 11:44:12,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:44:12,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:44:12,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:44:12,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:44:12,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:44:12,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:44:12,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:44:12,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:44:12,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:44:12,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:44:12,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:44:12,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:44:12,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:44:12,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:44:12,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:44:12,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:44:12,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:44:12,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:44:12,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:44:12,835 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:44:12,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:44:12,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:44:12,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:44:12,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:44:12,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:44:12,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:44:12,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:44:12,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:44:12,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:44:12,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:44:12,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:44:12,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:44:12,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:44:12,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:44:12,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:44:12,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:44:12,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:44:12,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:44:12,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:44:12,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:44:12,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:44:12,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:44:12,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:44:12,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:44:12,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:44:12,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:44:12,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:44:12,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:44:12,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:44:12,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:44:12,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:44:12,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:44:12,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:44:12,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:44:12,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:44:12,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:44:12,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:44:12,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:44:12,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:44:12,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:44:12,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:44:12,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:44:12,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:44:12,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:44:12,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:44:12,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:44:12,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:44:12,909 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-21 11:44:13,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:44:13,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:44:13,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:44:13,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:44:13,304 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:44:13,307 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-21 11:44:13,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41be5c0d5/5a7c7611ff0244599c0181af1b76ad1b/FLAG08b6c9e57 [2022-07-21 11:44:14,140 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:44:14,142 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-21 11:44:14,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41be5c0d5/5a7c7611ff0244599c0181af1b76ad1b/FLAG08b6c9e57 [2022-07-21 11:44:14,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41be5c0d5/5a7c7611ff0244599c0181af1b76ad1b [2022-07-21 11:44:14,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:44:14,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:44:14,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:44:14,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:44:14,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:44:14,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:44:14" (1/1) ... [2022-07-21 11:44:14,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b44dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:14, skipping insertion in model container [2022-07-21 11:44:14,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:44:14" (1/1) ... [2022-07-21 11:44:14,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:44:14,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:44:15,275 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-21 11:44:15,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:44:15,340 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:44:15,560 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-21 11:44:15,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:44:15,611 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:44:15,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15 WrapperNode [2022-07-21 11:44:15,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:44:15,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:44:15,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:44:15,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:44:15,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,743 INFO L137 Inliner]: procedures = 114, calls = 417, calls flagged for inlining = 49, calls inlined = 46, statements flattened = 1211 [2022-07-21 11:44:15,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:44:15,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:44:15,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:44:15,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:44:15,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:44:15,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:44:15,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:44:15,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:44:15,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (1/1) ... [2022-07-21 11:44:15,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:44:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:44:15,925 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-21 11:44:15,950 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-21 11:44:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure raw_open [2022-07-21 11:44:15,967 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_open [2022-07-21 11:44:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-21 11:44:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-21 11:44:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:44:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:44:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:44:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 11:44:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 11:44:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_read_iter [2022-07-21 11:44:15,969 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_read_iter [2022-07-21 11:44:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:44:15,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:44:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-21 11:44:15,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-21 11:44:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure bind_get [2022-07-21 11:44:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_get [2022-07-21 11:44:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:44:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 11:44:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 11:44:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 11:44:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 11:44:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:44:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:44:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:44:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:44:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure bind_set [2022-07-21 11:44:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_set [2022-07-21 11:44:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-21 11:44:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-21 11:44:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 11:44:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 11:44:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:44:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:44:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:44:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-21 11:44:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-21 11:44:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:44:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 11:44:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 11:44:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-21 11:44:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-21 11:44:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:44:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:44:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_fsync [2022-07-21 11:44:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_fsync [2022-07-21 11:44:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2022-07-21 11:44:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2022-07-21 11:44:15,977 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-21 11:44:15,977 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-21 11:44:15,977 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-21 11:44:15,978 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-21 11:44:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 11:44:15,978 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 11:44:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_write_iter [2022-07-21 11:44:15,979 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_write_iter [2022-07-21 11:44:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:44:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:44:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:44:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 11:44:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 11:44:16,309 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:44:16,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:44:16,696 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:44:17,238 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:44:17,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:44:17,248 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:44:17,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:44:17 BoogieIcfgContainer [2022-07-21 11:44:17,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:44:17,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:44:17,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:44:17,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:44:17,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:44:14" (1/3) ... [2022-07-21 11:44:17,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57374ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:44:17, skipping insertion in model container [2022-07-21 11:44:17,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:44:15" (2/3) ... [2022-07-21 11:44:17,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57374ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:44:17, skipping insertion in model container [2022-07-21 11:44:17,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:44:17" (3/3) ... [2022-07-21 11:44:17,258 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-21 11:44:17,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:44:17,272 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:44:17,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:44:17,388 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@4e77704b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d7b2925 [2022-07-21 11:44:17,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:44:17,396 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-21 11:44:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-21 11:44:17,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:17,425 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-21 11:44:17,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -837597320, now seen corresponding path program 1 times [2022-07-21 11:44:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582481956] [2022-07-21 11:44:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 11:44:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 11:44:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 11:44:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:18,311 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-21 11:44:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:18,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582481956] [2022-07-21 11:44:18,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582481956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:18,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:18,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:44:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662804141] [2022-07-21 11:44:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:18,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:44:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:44:18,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:44:18,349 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-21 11:44:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:19,603 INFO L93 Difference]: Finished difference Result 1122 states and 1580 transitions. [2022-07-21 11:44:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:44:19,606 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-21 11:44:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:19,621 INFO L225 Difference]: With dead ends: 1122 [2022-07-21 11:44:19,622 INFO L226 Difference]: Without dead ends: 726 [2022-07-21 11:44:19,628 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-21 11:44:19,630 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 879 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-21 11:44:19,631 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-21 11:44:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-21 11:44:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 661. [2022-07-21 11:44:19,719 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-21 11:44:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 897 transitions. [2022-07-21 11:44:19,725 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 897 transitions. Word has length 178 [2022-07-21 11:44:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 897 transitions. [2022-07-21 11:44:19,727 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-21 11:44:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 897 transitions. [2022-07-21 11:44:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 11:44:19,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:19,731 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-21 11:44:19,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:44:19,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 210178479, now seen corresponding path program 1 times [2022-07-21 11:44:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:19,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774986486] [2022-07-21 11:44:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:20,219 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-21 11:44:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774986486] [2022-07-21 11:44:20,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774986486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:20,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:20,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:44:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476460096] [2022-07-21 11:44:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:20,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:44:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:20,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:44:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:44:20,224 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-21 11:44:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:21,033 INFO L93 Difference]: Finished difference Result 1368 states and 1876 transitions. [2022-07-21 11:44:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:44:21,034 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-21 11:44:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:21,041 INFO L225 Difference]: With dead ends: 1368 [2022-07-21 11:44:21,041 INFO L226 Difference]: Without dead ends: 757 [2022-07-21 11:44:21,044 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-21 11:44:21,046 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 724 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:21,046 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.7s Time] [2022-07-21 11:44:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-21 11:44:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 661. [2022-07-21 11:44:21,110 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-21 11:44:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 896 transitions. [2022-07-21 11:44:21,117 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 896 transitions. Word has length 177 [2022-07-21 11:44:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:21,118 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 896 transitions. [2022-07-21 11:44:21,118 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-21 11:44:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 896 transitions. [2022-07-21 11:44:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 11:44:21,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:21,128 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-21 11:44:21,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:44:21,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1478765263, now seen corresponding path program 1 times [2022-07-21 11:44:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:21,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366972772] [2022-07-21 11:44:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:21,516 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-21 11:44:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:21,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366972772] [2022-07-21 11:44:21,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366972772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:21,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:21,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:44:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691899809] [2022-07-21 11:44:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:44:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:44:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:44:21,521 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-21 11:44:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:22,663 INFO L93 Difference]: Finished difference Result 2068 states and 2847 transitions. [2022-07-21 11:44:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:44:22,664 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-21 11:44:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:22,675 INFO L225 Difference]: With dead ends: 2068 [2022-07-21 11:44:22,675 INFO L226 Difference]: Without dead ends: 1441 [2022-07-21 11:44:22,678 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-21 11:44:22,684 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, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:22,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1472 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:44:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-07-21 11:44:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1253. [2022-07-21 11:44:22,765 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-21 11:44:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1708 transitions. [2022-07-21 11:44:22,773 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1708 transitions. Word has length 177 [2022-07-21 11:44:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:22,774 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1708 transitions. [2022-07-21 11:44:22,775 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-21 11:44:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1708 transitions. [2022-07-21 11:44:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-21 11:44:22,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:22,779 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-21 11:44:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:44:22,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1465783967, now seen corresponding path program 1 times [2022-07-21 11:44:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:22,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867994695] [2022-07-21 11:44:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 11:44:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 11:44:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:23,079 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-21 11:44:23,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:23,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867994695] [2022-07-21 11:44:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867994695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:23,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:23,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:44:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083052324] [2022-07-21 11:44:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:23,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:44:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:44:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:44:23,082 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-21 11:44:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:23,932 INFO L93 Difference]: Finished difference Result 3258 states and 4422 transitions. [2022-07-21 11:44:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:44:23,933 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-21 11:44:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:23,944 INFO L225 Difference]: With dead ends: 3258 [2022-07-21 11:44:23,945 INFO L226 Difference]: Without dead ends: 2055 [2022-07-21 11:44:23,949 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-21 11:44:23,950 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 664 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:23,950 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.7s Time] [2022-07-21 11:44:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-07-21 11:44:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1833. [2022-07-21 11:44:24,043 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-21 11:44:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2471 transitions. [2022-07-21 11:44:24,053 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2471 transitions. Word has length 200 [2022-07-21 11:44:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:24,054 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2471 transitions. [2022-07-21 11:44:24,055 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-21 11:44:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2471 transitions. [2022-07-21 11:44:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-21 11:44:24,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:24,060 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-21 11:44:24,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:44:24,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1995507625, now seen corresponding path program 1 times [2022-07-21 11:44:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:24,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166867148] [2022-07-21 11:44:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:44:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:44:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 11:44:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 11:44:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:24,427 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-21 11:44:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166867148] [2022-07-21 11:44:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166867148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:24,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:44:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721196463] [2022-07-21 11:44:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:24,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:44:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:44:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:44:24,430 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-21 11:44:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:25,200 INFO L93 Difference]: Finished difference Result 3196 states and 4288 transitions. [2022-07-21 11:44:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:44:25,201 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-21 11:44:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:25,212 INFO L225 Difference]: With dead ends: 3196 [2022-07-21 11:44:25,212 INFO L226 Difference]: Without dead ends: 1411 [2022-07-21 11:44:25,239 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-21 11:44:25,241 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-21 11:44:25,241 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-21 11:44:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-21 11:44:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1215. [2022-07-21 11:44:25,304 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-21 11:44:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1604 transitions. [2022-07-21 11:44:25,314 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1604 transitions. Word has length 267 [2022-07-21 11:44:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:25,315 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1604 transitions. [2022-07-21 11:44:25,315 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-21 11:44:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1604 transitions. [2022-07-21 11:44:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-21 11:44:25,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:25,320 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-21 11:44:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:44:25,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1551606951, now seen corresponding path program 1 times [2022-07-21 11:44:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:25,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117879288] [2022-07-21 11:44:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:44:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:44:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 11:44:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 11:44:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:25,709 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-21 11:44:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:25,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117879288] [2022-07-21 11:44:25,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117879288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:25,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:25,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:44:25,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991038040] [2022-07-21 11:44:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:25,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:44:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:44:25,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:44:25,713 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-21 11:44:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:26,788 INFO L93 Difference]: Finished difference Result 2898 states and 3833 transitions. [2022-07-21 11:44:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:44:26,788 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-21 11:44:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:26,799 INFO L225 Difference]: With dead ends: 2898 [2022-07-21 11:44:26,799 INFO L226 Difference]: Without dead ends: 1848 [2022-07-21 11:44:26,803 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-21 11:44:26,806 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 667 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:26,806 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.9s Time] [2022-07-21 11:44:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-07-21 11:44:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1575. [2022-07-21 11:44:26,881 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-21 11:44:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2073 transitions. [2022-07-21 11:44:26,888 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2073 transitions. Word has length 267 [2022-07-21 11:44:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:26,889 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2073 transitions. [2022-07-21 11:44:26,889 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-21 11:44:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2073 transitions. [2022-07-21 11:44:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-21 11:44:26,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:26,894 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-21 11:44:26,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:44:26,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -350932392, now seen corresponding path program 1 times [2022-07-21 11:44:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:26,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137382679] [2022-07-21 11:44:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:44:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:44:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 11:44:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 11:44:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-21 11:44:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:27,470 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-21 11:44:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:27,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137382679] [2022-07-21 11:44:27,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137382679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:27,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 11:44:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223635035] [2022-07-21 11:44:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 11:44:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 11:44:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:44:27,473 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-21 11:44:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:29,525 INFO L93 Difference]: Finished difference Result 4803 states and 6330 transitions. [2022-07-21 11:44:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 11:44:29,526 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-21 11:44:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:29,541 INFO L225 Difference]: With dead ends: 4803 [2022-07-21 11:44:29,541 INFO L226 Difference]: Without dead ends: 3393 [2022-07-21 11:44:29,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:44:29,547 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 823 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:29,547 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.7s Time] [2022-07-21 11:44:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-21 11:44:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2675. [2022-07-21 11:44:29,677 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-21 11:44:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3541 transitions. [2022-07-21 11:44:29,701 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3541 transitions. Word has length 286 [2022-07-21 11:44:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:29,702 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3541 transitions. [2022-07-21 11:44:29,702 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-21 11:44:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3541 transitions. [2022-07-21 11:44:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-21 11:44:29,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:29,710 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-21 11:44:29,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:44:29,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash 311520253, now seen corresponding path program 1 times [2022-07-21 11:44:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:29,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079751203] [2022-07-21 11:44:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:44:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:44:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:44:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 11:44:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 11:44:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-21 11:44:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-21 11:44:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:30,275 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-21 11:44:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:30,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079751203] [2022-07-21 11:44:30,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079751203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:30,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:44:30,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:44:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285539831] [2022-07-21 11:44:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:44:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:44:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:44:30,279 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-21 11:44:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:31,195 INFO L93 Difference]: Finished difference Result 5643 states and 7511 transitions. [2022-07-21 11:44:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:44:31,196 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-21 11:44:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:31,215 INFO L225 Difference]: With dead ends: 5643 [2022-07-21 11:44:31,215 INFO L226 Difference]: Without dead ends: 3133 [2022-07-21 11:44:31,224 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-21 11:44:31,225 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 467 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:31,225 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.7s Time] [2022-07-21 11:44:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-07-21 11:44:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2703. [2022-07-21 11:44:31,398 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-21 11:44:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3585 transitions. [2022-07-21 11:44:31,412 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3585 transitions. Word has length 306 [2022-07-21 11:44:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:31,413 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 3585 transitions. [2022-07-21 11:44:31,413 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-21 11:44:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3585 transitions. [2022-07-21 11:44:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-21 11:44:31,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:31,420 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-21 11:44:31,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:44:31,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1101263580, now seen corresponding path program 1 times [2022-07-21 11:44:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545891321] [2022-07-21 11:44:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:44:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:44:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:44:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 11:44:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 11:44:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-21 11:44:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-21 11:44:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:31,927 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-21 11:44:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:31,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545891321] [2022-07-21 11:44:31,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545891321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:44:31,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239944408] [2022-07-21 11:44:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:44:31,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:44:31,930 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-21 11:44:31,963 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-21 11:44:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:32,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 2457 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 11:44:32,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:44:32,656 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-21 11:44:32,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:44:32,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239944408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:32,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:44:32,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-21 11:44:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540070157] [2022-07-21 11:44:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:32,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:44:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:44:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:44:32,659 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-21 11:44:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:32,832 INFO L93 Difference]: Finished difference Result 4225 states and 5561 transitions. [2022-07-21 11:44:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:44:32,832 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-21 11:44:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:32,839 INFO L225 Difference]: With dead ends: 4225 [2022-07-21 11:44:32,839 INFO L226 Difference]: Without dead ends: 1646 [2022-07-21 11:44:32,844 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-21 11:44:32,845 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-21 11:44:32,845 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-21 11:44:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-07-21 11:44:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1547. [2022-07-21 11:44:32,921 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-21 11:44:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2022-07-21 11:44:32,927 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 305 [2022-07-21 11:44:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:32,939 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2022-07-21 11:44:32,940 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-21 11:44:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2022-07-21 11:44:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-21 11:44:32,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:32,946 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-21 11:44:32,986 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-21 11:44:33,167 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-21 11:44:33,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash -191141444, now seen corresponding path program 1 times [2022-07-21 11:44:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621934015] [2022-07-21 11:44:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:44:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:44:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:44:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:44:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:44:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:44:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:44:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:44:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:44:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:44:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:44:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:44:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:44:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:44:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:44:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 11:44:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 11:44:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 11:44:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 11:44:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-21 11:44:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:33,637 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-21 11:44:33,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:33,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621934015] [2022-07-21 11:44:33,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621934015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:44:33,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827242406] [2022-07-21 11:44:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:44:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:44:33,640 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-21 11:44:33,672 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-21 11:44:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:34,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 11:44:34,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:44:34,535 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-21 11:44:34,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:44:34,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827242406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:44:34,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:44:34,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-21 11:44:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227276484] [2022-07-21 11:44:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:44:34,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:44:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:44:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:44:34,544 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-21 11:44:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:44:34,701 INFO L93 Difference]: Finished difference Result 3072 states and 4060 transitions. [2022-07-21 11:44:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:44:34,702 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-21 11:44:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:44:34,712 INFO L225 Difference]: With dead ends: 3072 [2022-07-21 11:44:34,712 INFO L226 Difference]: Without dead ends: 1548 [2022-07-21 11:44:34,716 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-21 11:44:34,717 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:44:34,718 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.1s Time] [2022-07-21 11:44:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-21 11:44:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2022-07-21 11:44:34,797 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-21 11:44:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2038 transitions. [2022-07-21 11:44:34,804 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2038 transitions. Word has length 317 [2022-07-21 11:44:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:44:34,805 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2038 transitions. [2022-07-21 11:44:34,805 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-21 11:44:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2038 transitions. [2022-07-21 11:44:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-21 11:44:34,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:44:34,811 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-21 11:44:34,841 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-21 11:44:35,027 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-21 11:44:35,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:44:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:44:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 931062163, now seen corresponding path program 1 times [2022-07-21 11:44:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:44:35,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153741629] [2022-07-21 11:44:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:44:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:44:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:44:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:44:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:44:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:44:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:44:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 11:44:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:44:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:44:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:44:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:44:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 11:44:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 11:44:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 11:44:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:44:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 11:44:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:44:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:44:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:44:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 11:44:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 11:44:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:44:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 11:44:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-21 11:44:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-21 11:44:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-21 11:44:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:44:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:44:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-21 11:44:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:35,608 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-21 11:44:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:44:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153741629] [2022-07-21 11:44:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153741629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:44:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231253393] [2022-07-21 11:44:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:44:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:44:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:44:35,612 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-21 11:44:35,644 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-21 11:44:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:44:36,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 319 conjunts are in the unsatisfiable core [2022-07-21 11:44:36,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:44:36,652 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-21 11:44:36,653 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-21 11:44:39,512 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-21 11:44:40,567 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-21 11:44:40,624 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-21 11:44:40,762 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-21 11:44:41,144 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-21 11:44:41,157 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-21 11:44:41,240 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-21 11:44:41,519 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-21 11:44:41,534 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-21 11:44:41,618 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-21 11:44:41,851 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-21 11:44:41,865 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-21 11:44:41,930 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-21 11:44:42,091 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-21 11:44:54,913 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 11:44:54,914 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-21 11:44:56,218 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-21 11:44:56,233 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-21 11:44:56,277 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-21 11:44:57,262 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-21 11:44:57,343 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 11:44:57,344 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-21 11:44:58,510 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-21 11:44:58,523 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-21 11:44:58,577 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-21 11:44:59,887 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-21 11:44:59,901 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-21 11:44:59,923 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-21 11:45:01,979 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-21 11:45:01,993 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-21 11:45:02,014 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-21 11:45:03,298 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-21 11:45:03,312 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-21 11:45:03,328 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-21 11:45:06,576 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-21 11:45:07,225 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-21 11:45:07,241 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-21 11:45:07,253 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-21 11:45:07,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:07,288 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-21 11:45:07,304 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-21 11:45:07,320 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-21 11:45:09,477 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-21 11:45:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:10,536 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-21 11:45:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:10,988 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-21 11:45:11,043 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-21 11:45:11,085 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-21 11:45:11,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:11,098 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-21 11:45:11,202 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-21 11:45:11,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:45:11,309 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-21 11:45:11,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231253393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:11,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:45:11,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 52] total 59 [2022-07-21 11:45:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389947479] [2022-07-21 11:45:11,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:45:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-21 11:45:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:45:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-21 11:45:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1891, Unknown=44, NotChecked=1442, Total=3660 [2022-07-21 11:45:11,316 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-21 11:45:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:27,844 INFO L93 Difference]: Finished difference Result 3342 states and 4415 transitions. [2022-07-21 11:45:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 11:45:27,845 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-21 11:45:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:27,854 INFO L225 Difference]: With dead ends: 3342 [2022-07-21 11:45:27,854 INFO L226 Difference]: Without dead ends: 1820 [2022-07-21 11:45:27,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 420 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=450, Invalid=3692, Unknown=74, NotChecked=1946, Total=6162 [2022-07-21 11:45:27,861 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 377 mSDsluCounter, 5780 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 12010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9007 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:45:27,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 6232 Invalid, 12010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2760 Invalid, 0 Unknown, 9007 Unchecked, 2.2s Time] [2022-07-21 11:45:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-07-21 11:45:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1558. [2022-07-21 11:45:27,951 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-21 11:45:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2055 transitions. [2022-07-21 11:45:27,956 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2055 transitions. Word has length 331 [2022-07-21 11:45:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:27,957 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 2055 transitions. [2022-07-21 11:45:27,958 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-21 11:45:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2055 transitions. [2022-07-21 11:45:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-07-21 11:45:27,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:27,965 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-21 11:45:27,998 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-21 11:45:28,179 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-21 11:45:28,180 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1184488591, now seen corresponding path program 1 times [2022-07-21 11:45:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529151878] [2022-07-21 11:45:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:45:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:45:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:45:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:45:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 11:45:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:45:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:45:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 11:45:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:45:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:45:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:45:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 11:45:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:45:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:45:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:45:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:45:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:45:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:45:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 11:45:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 11:45:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 11:45:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 11:45:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-21 11:45:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-21 11:45:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:45:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-21 11:45:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:28,836 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-21 11:45:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529151878] [2022-07-21 11:45:28,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529151878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075119482] [2022-07-21 11:45:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:28,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:28,839 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-21 11:45:28,840 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-21 11:45:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:30,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 11:45:30,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:30,364 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-21 11:45:30,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:45:30,661 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-21 11:45:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075119482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:45:30,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:45:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 5] total 19 [2022-07-21 11:45:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929023835] [2022-07-21 11:45:30,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:45:30,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 11:45:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:45:30,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 11:45:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-07-21 11:45:30,668 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-21 11:45:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:32,438 INFO L93 Difference]: Finished difference Result 3344 states and 4429 transitions. [2022-07-21 11:45:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 11:45:32,439 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-21 11:45:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:32,447 INFO L225 Difference]: With dead ends: 3344 [2022-07-21 11:45:32,447 INFO L226 Difference]: Without dead ends: 1803 [2022-07-21 11:45:32,450 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-21 11:45:32,451 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 639 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:45:32,451 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.3s Time] [2022-07-21 11:45:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-21 11:45:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1559. [2022-07-21 11:45:32,526 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-21 11:45:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2049 transitions. [2022-07-21 11:45:32,530 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2049 transitions. Word has length 334 [2022-07-21 11:45:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:32,531 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2049 transitions. [2022-07-21 11:45:32,531 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-21 11:45:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2049 transitions. [2022-07-21 11:45:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-21 11:45:32,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:32,537 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-21 11:45:32,575 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-21 11:45:32,763 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-21 11:45:32,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash 943002118, now seen corresponding path program 2 times [2022-07-21 11:45:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:32,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901114065] [2022-07-21 11:45:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:45:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:45:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:45:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:45:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 11:45:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:45:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:45:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:45:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:45:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 11:45:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 11:45:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 11:45:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 11:45:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 11:45:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 11:45:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 11:45:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:45:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:45:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 11:45:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-21 11:45:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-21 11:45:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-21 11:45:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-21 11:45:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-21 11:45:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:45:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-21 11:45:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:33,558 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-21 11:45:33,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901114065] [2022-07-21 11:45:33,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901114065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:33,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420698038] [2022-07-21 11:45:33,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:45:33,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:33,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:33,564 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-21 11:45:33,565 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-21 11:45:34,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:45:34,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:45:34,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 11:45:34,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:34,581 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-21 11:45:34,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:45:34,891 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-21 11:45:34,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420698038] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:45:34,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:45:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2022-07-21 11:45:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242235826] [2022-07-21 11:45:34,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:45:34,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 11:45:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:45:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 11:45:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-21 11:45:34,897 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-21 11:45:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:36,302 INFO L93 Difference]: Finished difference Result 3341 states and 4411 transitions. [2022-07-21 11:45:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 11:45:36,303 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-21 11:45:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:36,311 INFO L225 Difference]: With dead ends: 3341 [2022-07-21 11:45:36,312 INFO L226 Difference]: Without dead ends: 1805 [2022-07-21 11:45:36,316 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-21 11:45:36,317 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 375 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-21 11:45:36,317 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-21 11:45:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-21 11:45:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1560. [2022-07-21 11:45:36,394 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-21 11:45:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2050 transitions. [2022-07-21 11:45:36,398 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2050 transitions. Word has length 362 [2022-07-21 11:45:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:36,399 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 2050 transitions. [2022-07-21 11:45:36,399 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-21 11:45:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2050 transitions. [2022-07-21 11:45:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-07-21 11:45:36,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:36,403 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-21 11:45:36,439 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-21 11:45:36,619 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-21 11:45:36,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash -298770021, now seen corresponding path program 3 times [2022-07-21 11:45:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:36,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239386668] [2022-07-21 11:45:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:45:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:45:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:36,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:45:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:45:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:45:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:45:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 11:45:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:45:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 11:45:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 11:45:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:45:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:45:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 11:45:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:45:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:45:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 11:45:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:45:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:45:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 11:45:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 11:45:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-21 11:45:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-21 11:45:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-21 11:45:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-21 11:45:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:45:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-21 11:45:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:37,390 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-21 11:45:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:37,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239386668] [2022-07-21 11:45:37,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239386668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:37,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707050595] [2022-07-21 11:45:37,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 11:45:37,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:37,423 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-21 11:45:37,451 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-21 11:45:40,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-21 11:45:40,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:45:40,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 11:45:40,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:40,995 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-21 11:45:40,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:45:41,321 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-21 11:45:41,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707050595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:45:41,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:45:41,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2022-07-21 11:45:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461853330] [2022-07-21 11:45:41,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:45:41,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 11:45:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:45:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 11:45:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-07-21 11:45:41,325 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-21 11:45:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:43,086 INFO L93 Difference]: Finished difference Result 3342 states and 4418 transitions. [2022-07-21 11:45:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 11:45:43,087 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-21 11:45:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:43,096 INFO L225 Difference]: With dead ends: 3342 [2022-07-21 11:45:43,096 INFO L226 Difference]: Without dead ends: 1802 [2022-07-21 11:45:43,102 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-21 11:45:43,102 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 216 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:45:43,103 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.3s Time] [2022-07-21 11:45:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-07-21 11:45:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1564. [2022-07-21 11:45:43,229 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-21 11:45:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2053 transitions. [2022-07-21 11:45:43,235 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2053 transitions. Word has length 367 [2022-07-21 11:45:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:43,235 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 2053 transitions. [2022-07-21 11:45:43,236 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-21 11:45:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2053 transitions. [2022-07-21 11:45:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-07-21 11:45:43,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:43,240 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-21 11:45:43,263 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-21 11:45:43,457 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-21 11:45:43,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 750840027, now seen corresponding path program 4 times [2022-07-21 11:45:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:43,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030600278] [2022-07-21 11:45:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:45:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:45:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:45:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:45:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:45:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 11:45:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:45:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:45:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 11:45:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:45:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 11:45:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 11:45:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 11:45:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 11:45:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 11:45:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 11:45:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:45:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 11:45:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-21 11:45:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 11:45:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-21 11:45:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-21 11:45:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-07-21 11:45:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-07-21 11:45:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 11:45:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-21 11:45:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:48,722 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-21 11:45:48,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:48,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030600278] [2022-07-21 11:45:48,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030600278] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:48,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201390731] [2022-07-21 11:45:48,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 11:45:48,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:48,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:48,725 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-21 11:45:48,749 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-21 11:45:49,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 11:45:49,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:45:49,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 432 conjunts are in the unsatisfiable core [2022-07-21 11:45:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:50,153 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-21 11:45:50,154 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-21 11:45:53,341 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-21 11:45:53,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:53,396 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-21 11:45:53,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:53,459 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-21 11:45:53,523 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 11:45:53,523 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-21 11:45:54,520 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-21 11:45:54,963 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-21 11:45:55,021 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-21 11:45:55,604 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-21 11:45:55,956 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-21 11:45:56,039 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-21 11:45:56,332 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-21 11:45:56,659 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-21 11:45:56,709 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-21 11:45:56,944 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-21 11:46:25,103 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 11:46:25,103 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-21 11:46:26,872 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-21 11:46:27,225 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-21 11:46:27,260 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-21 11:46:28,678 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-21 11:46:28,829 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-21 11:46:28,866 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-21 11:46:30,281 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-21 11:46:30,635 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-21 11:46:30,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 11:46:32,713 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-21 11:46:33,124 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-21 11:46:33,150 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-21 11:46:34,919 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-21 11:47:09,553 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 11:47:09,553 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-21 11:47:11,309 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-21 11:47:11,475 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-21 11:47:11,487 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-21 11:47:12,775 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-21 11:47:13,144 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-21 11:47:13,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, 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-21 11:47:20,381 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-21 11:47:21,487 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-21 11:47:21,498 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-21 11:47:21,506 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-21 11:47:21,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:47:21,531 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-21 11:47:21,552 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-21 11:47:21,569 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-21 11:47:24,578 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-21 11:47:26,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:47:26,021 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-21 11:47:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:47:26,746 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-21 11:47:26,947 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-21 11:47:26,967 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-21 11:47:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:47:26,974 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-21 11:47:27,052 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-21 11:47:27,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:47:27,354 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-21 11:47:27,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201390731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:47:27,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:47:27,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 66] total 110 [2022-07-21 11:47:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700799916] [2022-07-21 11:47:27,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:47:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-21 11:47:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:47:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-21 11:47:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=9223, Unknown=90, NotChecked=2954, Total=13110 [2022-07-21 11:47:27,362 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-21 11:47:52,600 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