./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:51:01,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:51:01,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:51:01,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:51:01,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:51:01,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:51:01,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:51:01,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:51:01,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:51:01,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:51:01,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:51:01,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:51:01,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:51:01,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:51:01,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:51:01,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:51:01,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:51:01,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:51:01,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:51:01,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:51:01,948 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:51:01,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:51:01,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:51:01,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:51:01,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:51:01,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:51:01,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:51:01,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:51:01,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:51:01,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:51:01,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:51:01,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:51:01,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:51:01,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:51:01,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:51:01,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:51:01,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:51:01,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:51:01,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:51:01,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:51:01,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:51:01,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:51:01,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 23:51:02,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:51:02,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:51:02,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:51:02,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:51:02,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:51:02,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:51:02,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:51:02,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:51:02,005 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:51:02,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:51:02,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 23:51:02,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:51:02,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:51:02,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:51:02,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:51:02,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:51:02,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:51:02,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:51:02,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:51:02,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:51:02,010 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2022-07-22 23:51:02,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:51:02,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:51:02,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:51:02,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:51:02,299 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:51:02,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-22 23:51:02,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa55d8a11/ae85f17e9e4e446bb88226ec39d7233a/FLAG01f4a72f1 [2022-07-22 23:51:03,071 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:51:03,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-22 23:51:03,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa55d8a11/ae85f17e9e4e446bb88226ec39d7233a/FLAG01f4a72f1 [2022-07-22 23:51:03,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa55d8a11/ae85f17e9e4e446bb88226ec39d7233a [2022-07-22 23:51:03,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:51:03,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:51:03,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:51:03,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:51:03,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:51:03,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:51:03" (1/1) ... [2022-07-22 23:51:03,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344ebaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:03, skipping insertion in model container [2022-07-22 23:51:03,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:51:03" (1/1) ... [2022-07-22 23:51:03,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:51:03,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:51:04,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-07-22 23:51:04,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:51:04,497 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:51:04,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-07-22 23:51:04,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:51:04,820 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:51:04,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04 WrapperNode [2022-07-22 23:51:04,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:51:04,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:51:04,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:51:04,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:51:04,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:04,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:04,981 INFO L137 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2426 [2022-07-22 23:51:04,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:51:04,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:51:04,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:51:04,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:51:04,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:04,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:51:05,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:51:05,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:51:05,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:51:05,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (1/1) ... [2022-07-22 23:51:05,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:51:05,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:51:05,200 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-22 23:51:05,215 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-22 23:51:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 23:51:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 23:51:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 23:51:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2022-07-22 23:51:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2022-07-22 23:51:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-22 23:51:05,241 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-22 23:51:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:51:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:51:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:51:05,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:51:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 23:51:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2022-07-22 23:51:05,242 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2022-07-22 23:51:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2022-07-22 23:51:05,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2022-07-22 23:51:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-22 23:51:05,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-22 23:51:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:51:05,242 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:51:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-22 23:51:05,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-22 23:51:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:51:05,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:51:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2022-07-22 23:51:05,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2022-07-22 23:51:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-22 23:51:05,243 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-22 23:51:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-22 23:51:05,244 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-22 23:51:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-22 23:51:05,244 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-22 23:51:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-22 23:51:05,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-22 23:51:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:51:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:51:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 23:51:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:51:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:51:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:51:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:51:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-22 23:51:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-22 23:51:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:51:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:51:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2022-07-22 23:51:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2022-07-22 23:51:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:51:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2022-07-22 23:51:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2022-07-22 23:51:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-22 23:51:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-22 23:51:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 23:51:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 23:51:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:51:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:51:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:51:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-22 23:51:05,250 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-22 23:51:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2022-07-22 23:51:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2022-07-22 23:51:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-22 23:51:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-22 23:51:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:51:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-22 23:51:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-22 23:51:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-22 23:51:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-22 23:51:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:51:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:51:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-22 23:51:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-22 23:51:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-22 23:51:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-22 23:51:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2022-07-22 23:51:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2022-07-22 23:51:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 23:51:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-22 23:51:05,254 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-22 23:51:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 23:51:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:51:05,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:51:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-22 23:51:05,254 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-22 23:51:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:51:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:51:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2022-07-22 23:51:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2022-07-22 23:51:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-22 23:51:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-22 23:51:05,737 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:51:05,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:51:06,206 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:51:09,387 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:51:09,401 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:51:09,401 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 23:51:09,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:51:09 BoogieIcfgContainer [2022-07-22 23:51:09,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:51:09,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:51:09,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:51:09,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:51:09,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:51:03" (1/3) ... [2022-07-22 23:51:09,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3350a85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:51:09, skipping insertion in model container [2022-07-22 23:51:09,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:51:04" (2/3) ... [2022-07-22 23:51:09,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3350a85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:51:09, skipping insertion in model container [2022-07-22 23:51:09,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:51:09" (3/3) ... [2022-07-22 23:51:09,411 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-07-22 23:51:09,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:51:09,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:51:09,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:51:09,540 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@396a3aae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e3670ba [2022-07-22 23:51:09,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:51:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-22 23:51:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 23:51:09,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:09,560 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:51:09,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1070293405, now seen corresponding path program 1 times [2022-07-22 23:51:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448567700] [2022-07-22 23:51:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:51:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:10,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448567700] [2022-07-22 23:51:10,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448567700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:10,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:10,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:51:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158847517] [2022-07-22 23:51:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:10,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:51:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:10,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:51:10,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:51:10,127 INFO L87 Difference]: Start difference. First operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:13,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:15,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:15,982 INFO L93 Difference]: Finished difference Result 2318 states and 3473 transitions. [2022-07-22 23:51:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:51:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-07-22 23:51:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:16,019 INFO L225 Difference]: With dead ends: 2318 [2022-07-22 23:51:16,019 INFO L226 Difference]: Without dead ends: 1560 [2022-07-22 23:51:16,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:51:16,033 INFO L413 NwaCegarLoop]: 1114 mSDtfsCounter, 1446 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 305 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:16,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2222 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 885 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-07-22 23:51:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-07-22 23:51:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1388. [2022-07-22 23:51:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-07-22 23:51:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2001 transitions. [2022-07-22 23:51:16,177 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2001 transitions. Word has length 78 [2022-07-22 23:51:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:16,178 INFO L495 AbstractCegarLoop]: Abstraction has 1388 states and 2001 transitions. [2022-07-22 23:51:16,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2001 transitions. [2022-07-22 23:51:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 23:51:16,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:16,184 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:51:16,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 23:51:16,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash 192122725, now seen corresponding path program 1 times [2022-07-22 23:51:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204619779] [2022-07-22 23:51:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-22 23:51:16,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:16,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204619779] [2022-07-22 23:51:16,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204619779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:16,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:16,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:51:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231922724] [2022-07-22 23:51:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:16,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:51:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:51:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:51:16,379 INFO L87 Difference]: Start difference. First operand 1388 states and 2001 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:20,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:22,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:22,772 INFO L93 Difference]: Finished difference Result 4449 states and 6499 transitions. [2022-07-22 23:51:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:51:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-22 23:51:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:22,790 INFO L225 Difference]: With dead ends: 4449 [2022-07-22 23:51:22,790 INFO L226 Difference]: Without dead ends: 3079 [2022-07-22 23:51:22,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:51:22,797 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 1479 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 319 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:22,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 3548 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1856 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-22 23:51:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2022-07-22 23:51:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 2815. [2022-07-22 23:51:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-07-22 23:51:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4094 transitions. [2022-07-22 23:51:22,936 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4094 transitions. Word has length 82 [2022-07-22 23:51:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:22,938 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 4094 transitions. [2022-07-22 23:51:22,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 23:51:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4094 transitions. [2022-07-22 23:51:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 23:51:22,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:22,950 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-22 23:51:22,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 23:51:22,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash 793541372, now seen corresponding path program 1 times [2022-07-22 23:51:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:22,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052107611] [2022-07-22 23:51:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 23:51:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:51:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:51:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 23:51:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-22 23:51:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:23,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052107611] [2022-07-22 23:51:23,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052107611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:23,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:23,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:51:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719268456] [2022-07-22 23:51:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:23,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:51:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:23,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:51:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:51:23,248 INFO L87 Difference]: Start difference. First operand 2815 states and 4094 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:51:27,276 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:27,461 INFO L93 Difference]: Finished difference Result 7425 states and 10845 transitions. [2022-07-22 23:51:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:51:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2022-07-22 23:51:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:27,488 INFO L225 Difference]: With dead ends: 7425 [2022-07-22 23:51:27,488 INFO L226 Difference]: Without dead ends: 4634 [2022-07-22 23:51:27,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:51:27,501 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 1923 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 760 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:27,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 2386 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 1345 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-07-22 23:51:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2022-07-22 23:51:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4145. [2022-07-22 23:51:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 3305 states have (on average 1.4338880484114978) internal successors, (4739), 3359 states have internal predecessors, (4739), 605 states have call successors, (605), 213 states have call predecessors, (605), 234 states have return successors, (680), 610 states have call predecessors, (680), 604 states have call successors, (680) [2022-07-22 23:51:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6024 transitions. [2022-07-22 23:51:27,660 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6024 transitions. Word has length 140 [2022-07-22 23:51:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:27,662 INFO L495 AbstractCegarLoop]: Abstraction has 4145 states and 6024 transitions. [2022-07-22 23:51:27,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:51:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6024 transitions. [2022-07-22 23:51:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 23:51:27,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:27,675 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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] [2022-07-22 23:51:27,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 23:51:27,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash -850191257, now seen corresponding path program 1 times [2022-07-22 23:51:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598151300] [2022-07-22 23:51:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 23:51:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 23:51:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 23:51:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:51:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 23:51:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:51:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 23:51:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:51:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 23:51:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-22 23:51:27,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:27,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598151300] [2022-07-22 23:51:27,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598151300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:27,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:27,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:51:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118958418] [2022-07-22 23:51:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:27,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:51:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:51:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:51:27,988 INFO L87 Difference]: Start difference. First operand 4145 states and 6024 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 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-22 23:51:32,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:34,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:36,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:38,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:38,460 INFO L93 Difference]: Finished difference Result 10898 states and 15785 transitions. [2022-07-22 23:51:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:51:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 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 169 [2022-07-22 23:51:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:38,493 INFO L225 Difference]: With dead ends: 10898 [2022-07-22 23:51:38,493 INFO L226 Difference]: Without dead ends: 6777 [2022-07-22 23:51:38,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:51:38,505 INFO L413 NwaCegarLoop]: 1491 mSDtfsCounter, 1567 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 536 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 3418 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:38,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 3418 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1430 Invalid, 4 Unknown, 0 Unchecked, 10.2s Time] [2022-07-22 23:51:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6777 states. [2022-07-22 23:51:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6777 to 6142. [2022-07-22 23:51:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 4931 states have (on average 1.4232407219630907) internal successors, (7018), 5015 states have internal predecessors, (7018), 840 states have call successors, (840), 335 states have call predecessors, (840), 370 states have return successors, (961), 851 states have call predecessors, (961), 839 states have call successors, (961) [2022-07-22 23:51:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 8819 transitions. [2022-07-22 23:51:38,740 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 8819 transitions. Word has length 169 [2022-07-22 23:51:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:38,741 INFO L495 AbstractCegarLoop]: Abstraction has 6142 states and 8819 transitions. [2022-07-22 23:51:38,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 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-22 23:51:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 8819 transitions. [2022-07-22 23:51:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 23:51:38,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:38,751 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2022-07-22 23:51:38,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 23:51:38,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1242981819, now seen corresponding path program 1 times [2022-07-22 23:51:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:38,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971928132] [2022-07-22 23:51:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:51:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:51:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 23:51:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:51:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:51:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 23:51:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-07-22 23:51:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971928132] [2022-07-22 23:51:39,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971928132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:39,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:39,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:51:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170431971] [2022-07-22 23:51:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:39,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:51:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:51:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:51:39,020 INFO L87 Difference]: Start difference. First operand 6142 states and 8819 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:51:43,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:45,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:45,444 INFO L93 Difference]: Finished difference Result 15902 states and 22823 transitions. [2022-07-22 23:51:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:51:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2022-07-22 23:51:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:45,493 INFO L225 Difference]: With dead ends: 15902 [2022-07-22 23:51:45,494 INFO L226 Difference]: Without dead ends: 9795 [2022-07-22 23:51:45,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:51:45,512 INFO L413 NwaCegarLoop]: 1001 mSDtfsCounter, 2814 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 1109 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1109 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:45,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 2416 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1109 Valid, 1456 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-22 23:51:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2022-07-22 23:51:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8838. [2022-07-22 23:51:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 7083 states have (on average 1.4126782436820555) internal successors, (10006), 7203 states have internal predecessors, (10006), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-22 23:51:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12522 transitions. [2022-07-22 23:51:45,888 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12522 transitions. Word has length 163 [2022-07-22 23:51:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:45,890 INFO L495 AbstractCegarLoop]: Abstraction has 8838 states and 12522 transitions. [2022-07-22 23:51:45,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:51:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12522 transitions. [2022-07-22 23:51:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-22 23:51:45,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:45,903 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2022-07-22 23:51:45,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 23:51:45,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2102218924, now seen corresponding path program 1 times [2022-07-22 23:51:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:45,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600754560] [2022-07-22 23:51:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:51:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:51:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 23:51:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:51:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:51:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 23:51:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-22 23:51:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:46,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600754560] [2022-07-22 23:51:46,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600754560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:51:46,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:51:46,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:51:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960199290] [2022-07-22 23:51:46,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:51:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:51:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:51:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:51:46,144 INFO L87 Difference]: Start difference. First operand 8838 states and 12522 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-22 23:51:49,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:51,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:51:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:51:52,123 INFO L93 Difference]: Finished difference Result 14382 states and 20599 transitions. [2022-07-22 23:51:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:51:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2022-07-22 23:51:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:51:52,172 INFO L225 Difference]: With dead ends: 14382 [2022-07-22 23:51:52,173 INFO L226 Difference]: Without dead ends: 9802 [2022-07-22 23:51:52,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:51:52,186 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 659 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 299 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:51:52,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 3210 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1660 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-07-22 23:51:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-07-22 23:51:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8858. [2022-07-22 23:51:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7103 states have (on average 1.4115162607349008) internal successors, (10026), 7223 states have internal predecessors, (10026), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-22 23:51:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 12542 transitions. [2022-07-22 23:51:52,540 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 12542 transitions. Word has length 168 [2022-07-22 23:51:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:51:52,541 INFO L495 AbstractCegarLoop]: Abstraction has 8858 states and 12542 transitions. [2022-07-22 23:51:52,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-22 23:51:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 12542 transitions. [2022-07-22 23:51:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-22 23:51:52,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:51:52,556 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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] [2022-07-22 23:51:52,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 23:51:52,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:51:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:51:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1844834605, now seen corresponding path program 1 times [2022-07-22 23:51:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:51:52,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522060790] [2022-07-22 23:51:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:51:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:51:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:51:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:51:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:51:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:51:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:51:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:51:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:51:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:51:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:51:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:51:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 23:51:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 23:51:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:51:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:51:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:51:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 23:51:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-22 23:51:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:51:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522060790] [2022-07-22 23:51:52,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522060790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:51:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897733732] [2022-07-22 23:51:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:51:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:51:52,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:51:52,958 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-22 23:51:52,959 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-22 23:51:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:51:53,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 23:51:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:51:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-22 23:51:53,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:51:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-22 23:51:54,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897733732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:51:54,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:51:54,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 17 [2022-07-22 23:51:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112989121] [2022-07-22 23:51:54,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:51:54,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 23:51:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:51:54,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 23:51:54,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:51:54,501 INFO L87 Difference]: Start difference. First operand 8858 states and 12542 transitions. Second operand has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-22 23:52:01,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:03,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:06,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:08,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:10,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:10,582 INFO L93 Difference]: Finished difference Result 24105 states and 34353 transitions. [2022-07-22 23:52:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-22 23:52:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) Word has length 170 [2022-07-22 23:52:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:10,643 INFO L225 Difference]: With dead ends: 24105 [2022-07-22 23:52:10,643 INFO L226 Difference]: Without dead ends: 15282 [2022-07-22 23:52:10,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 378 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1399, Unknown=0, NotChecked=0, Total=1806 [2022-07-22 23:52:10,672 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 4829 mSDsluCounter, 5483 mSDsCounter, 0 mSdLazyCounter, 6094 mSolverCounterSat, 1889 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4963 SdHoareTripleChecker+Valid, 6512 SdHoareTripleChecker+Invalid, 7988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1889 IncrementalHoareTripleChecker+Valid, 6094 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:10,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4963 Valid, 6512 Invalid, 7988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1889 Valid, 6094 Invalid, 5 Unknown, 0 Unchecked, 15.3s Time] [2022-07-22 23:52:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15282 states. [2022-07-22 23:52:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15282 to 13435. [2022-07-22 23:52:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13435 states, 10715 states have (on average 1.4011199253383109) internal successors, (15013), 10881 states have internal predecessors, (15013), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-22 23:52:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13435 states to 13435 states and 18852 transitions. [2022-07-22 23:52:11,251 INFO L78 Accepts]: Start accepts. Automaton has 13435 states and 18852 transitions. Word has length 170 [2022-07-22 23:52:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:11,251 INFO L495 AbstractCegarLoop]: Abstraction has 13435 states and 18852 transitions. [2022-07-22 23:52:11,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-22 23:52:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 13435 states and 18852 transitions. [2022-07-22 23:52:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-22 23:52:11,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:11,269 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 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] [2022-07-22 23:52:11,298 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-22 23:52:11,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:11,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1828209139, now seen corresponding path program 1 times [2022-07-22 23:52:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:11,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532541221] [2022-07-22 23:52:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 23:52:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:52:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-22 23:52:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-22 23:52:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-22 23:52:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532541221] [2022-07-22 23:52:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532541221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:11,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:52:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738592540] [2022-07-22 23:52:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:52:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:52:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:52:11,756 INFO L87 Difference]: Start difference. First operand 13435 states and 18852 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:16,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:16,558 INFO L93 Difference]: Finished difference Result 33436 states and 46809 transitions. [2022-07-22 23:52:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:16,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 195 [2022-07-22 23:52:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:16,671 INFO L225 Difference]: With dead ends: 33436 [2022-07-22 23:52:16,671 INFO L226 Difference]: Without dead ends: 20036 [2022-07-22 23:52:16,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:16,705 INFO L413 NwaCegarLoop]: 1610 mSDtfsCounter, 1412 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 448 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:16,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 3703 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1882 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 23:52:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2022-07-22 23:52:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 13459. [2022-07-22 23:52:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13459 states, 10739 states have (on average 1.400223484495763) internal successors, (15037), 10905 states have internal predecessors, (15037), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-22 23:52:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 18876 transitions. [2022-07-22 23:52:17,408 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 18876 transitions. Word has length 195 [2022-07-22 23:52:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:17,408 INFO L495 AbstractCegarLoop]: Abstraction has 13459 states and 18876 transitions. [2022-07-22 23:52:17,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:52:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 18876 transitions. [2022-07-22 23:52:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-22 23:52:17,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:17,424 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:17,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 23:52:17,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1124632277, now seen corresponding path program 1 times [2022-07-22 23:52:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:17,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202721272] [2022-07-22 23:52:17,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:52:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:52:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 23:52:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:52:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-22 23:52:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202721272] [2022-07-22 23:52:17,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202721272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:17,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:17,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 23:52:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520579959] [2022-07-22 23:52:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:17,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:52:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:52:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:17,823 INFO L87 Difference]: Start difference. First operand 13459 states and 18876 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 23:52:22,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:24,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:26,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:26,672 INFO L93 Difference]: Finished difference Result 28371 states and 39874 transitions. [2022-07-22 23:52:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2022-07-22 23:52:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:26,732 INFO L225 Difference]: With dead ends: 28371 [2022-07-22 23:52:26,733 INFO L226 Difference]: Without dead ends: 14947 [2022-07-22 23:52:26,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:52:26,759 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 394 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:26,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 3880 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2326 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-07-22 23:52:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-07-22 23:52:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13507. [2022-07-22 23:52:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13507 states, 10775 states have (on average 1.3988863109048724) internal successors, (15073), 10941 states have internal predecessors, (15073), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-22 23:52:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13507 states to 13507 states and 18927 transitions. [2022-07-22 23:52:27,310 INFO L78 Accepts]: Start accepts. Automaton has 13507 states and 18927 transitions. Word has length 206 [2022-07-22 23:52:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:27,310 INFO L495 AbstractCegarLoop]: Abstraction has 13507 states and 18927 transitions. [2022-07-22 23:52:27,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 23:52:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13507 states and 18927 transitions. [2022-07-22 23:52:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-22 23:52:27,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:27,326 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 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] [2022-07-22 23:52:27,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 23:52:27,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash -928227653, now seen corresponding path program 1 times [2022-07-22 23:52:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:27,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138866254] [2022-07-22 23:52:27,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:52:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:52:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 23:52:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-22 23:52:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-22 23:52:27,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:27,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138866254] [2022-07-22 23:52:27,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138866254] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:27,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251542984] [2022-07-22 23:52:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:27,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:27,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:27,571 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-22 23:52:27,572 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-22 23:52:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:28,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:52:28,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-22 23:52:28,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:28,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251542984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:28,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:28,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-22 23:52:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157057628] [2022-07-22 23:52:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:28,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:52:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:52:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:52:28,145 INFO L87 Difference]: Start difference. First operand 13507 states and 18927 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-22 23:52:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:28,984 INFO L93 Difference]: Finished difference Result 33048 states and 46290 transitions. [2022-07-22 23:52:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:52:28,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 213 [2022-07-22 23:52:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:29,055 INFO L225 Difference]: With dead ends: 33048 [2022-07-22 23:52:29,055 INFO L226 Difference]: Without dead ends: 19576 [2022-07-22 23:52:29,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:52:29,082 INFO L413 NwaCegarLoop]: 1898 mSDtfsCounter, 1323 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 6119 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:29,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 6119 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:52:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2022-07-22 23:52:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 13519. [2022-07-22 23:52:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13519 states, 10787 states have (on average 1.3984425697598961) internal successors, (15085), 10941 states have internal predecessors, (15085), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-22 23:52:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13519 states to 13519 states and 18939 transitions. [2022-07-22 23:52:29,756 INFO L78 Accepts]: Start accepts. Automaton has 13519 states and 18939 transitions. Word has length 213 [2022-07-22 23:52:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:29,756 INFO L495 AbstractCegarLoop]: Abstraction has 13519 states and 18939 transitions. [2022-07-22 23:52:29,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-22 23:52:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13519 states and 18939 transitions. [2022-07-22 23:52:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-22 23:52:29,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:29,773 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:29,801 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-22 23:52:29,995 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-22 23:52:29,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:29,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:29,996 INFO L85 PathProgramCache]: Analyzing trace with hash -486438682, now seen corresponding path program 1 times [2022-07-22 23:52:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:29,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091648003] [2022-07-22 23:52:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 23:52:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 23:52:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 23:52:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:52:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 23:52:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 23:52:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 23:52:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 23:52:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-22 23:52:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:52:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-22 23:52:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091648003] [2022-07-22 23:52:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091648003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914888331] [2022-07-22 23:52:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:30,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:30,397 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-22 23:52:30,407 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-22 23:52:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:52:31,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-22 23:52:31,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:31,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914888331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:31,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:31,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-07-22 23:52:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936782561] [2022-07-22 23:52:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:31,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:52:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:31,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:52:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:31,354 INFO L87 Difference]: Start difference. First operand 13519 states and 18939 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 23:52:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:32,056 INFO L93 Difference]: Finished difference Result 18303 states and 25413 transitions. [2022-07-22 23:52:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 23:52:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 251 [2022-07-22 23:52:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:32,113 INFO L225 Difference]: With dead ends: 18303 [2022-07-22 23:52:32,113 INFO L226 Difference]: Without dead ends: 18294 [2022-07-22 23:52:32,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:52:32,124 INFO L413 NwaCegarLoop]: 1732 mSDtfsCounter, 1622 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:32,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 2318 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:52:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18294 states. [2022-07-22 23:52:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18294 to 16793. [2022-07-22 23:52:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 13347 states have (on average 1.386603731175545) internal successors, (18507), 13535 states have internal predecessors, (18507), 2278 states have call successors, (2278), 1080 states have call predecessors, (2278), 1167 states have return successors, (2584), 2321 states have call predecessors, (2584), 2277 states have call successors, (2584) [2022-07-22 23:52:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 23369 transitions. [2022-07-22 23:52:33,073 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 23369 transitions. Word has length 251 [2022-07-22 23:52:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:33,074 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 23369 transitions. [2022-07-22 23:52:33,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 23:52:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 23369 transitions. [2022-07-22 23:52:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-22 23:52:33,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:33,091 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:52:33,119 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-22 23:52:33,315 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-22 23:52:33,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1296230958, now seen corresponding path program 1 times [2022-07-22 23:52:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828150463] [2022-07-22 23:52:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 23:52:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 23:52:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 23:52:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:52:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 23:52:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 23:52:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 23:52:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 23:52:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-22 23:52:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:52:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-22 23:52:33,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:33,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828150463] [2022-07-22 23:52:33,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828150463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:33,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:33,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:52:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068254337] [2022-07-22 23:52:33,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:33,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:52:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:33,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:52:33,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:52:33,732 INFO L87 Difference]: Start difference. First operand 16793 states and 23369 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 23:52:36,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:38,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:39,100 INFO L93 Difference]: Finished difference Result 25950 states and 36184 transitions. [2022-07-22 23:52:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:52:39,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 255 [2022-07-22 23:52:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:39,126 INFO L225 Difference]: With dead ends: 25950 [2022-07-22 23:52:39,126 INFO L226 Difference]: Without dead ends: 8033 [2022-07-22 23:52:39,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:52:39,158 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1472 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 459 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:39,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1940 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 568 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-07-22 23:52:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2022-07-22 23:52:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 7346. [2022-07-22 23:52:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7346 states, 5820 states have (on average 1.3752577319587629) internal successors, (8004), 5903 states have internal predecessors, (8004), 999 states have call successors, (999), 486 states have call predecessors, (999), 526 states have return successors, (1142), 1022 states have call predecessors, (1142), 998 states have call successors, (1142) [2022-07-22 23:52:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10145 transitions. [2022-07-22 23:52:39,624 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10145 transitions. Word has length 255 [2022-07-22 23:52:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:39,624 INFO L495 AbstractCegarLoop]: Abstraction has 7346 states and 10145 transitions. [2022-07-22 23:52:39,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 23:52:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10145 transitions. [2022-07-22 23:52:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-22 23:52:39,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:39,633 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:39,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 23:52:39,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1689020113, now seen corresponding path program 1 times [2022-07-22 23:52:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:39,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625744369] [2022-07-22 23:52:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 23:52:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 23:52:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 23:52:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:52:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 23:52:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 23:52:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 23:52:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 23:52:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-22 23:52:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:52:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-22 23:52:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-22 23:52:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:40,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625744369] [2022-07-22 23:52:40,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625744369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:40,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:52:40,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 23:52:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411723928] [2022-07-22 23:52:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 23:52:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 23:52:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:52:40,119 INFO L87 Difference]: Start difference. First operand 7346 states and 10145 transitions. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-22 23:52:45,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:47,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:49,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:51,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:52:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:51,918 INFO L93 Difference]: Finished difference Result 17482 states and 24607 transitions. [2022-07-22 23:52:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:52:51,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 268 [2022-07-22 23:52:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:51,937 INFO L225 Difference]: With dead ends: 17482 [2022-07-22 23:52:51,937 INFO L226 Difference]: Without dead ends: 10217 [2022-07-22 23:52:51,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-22 23:52:51,949 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1812 mSDsluCounter, 6300 mSDsCounter, 0 mSdLazyCounter, 4590 mSolverCounterSat, 372 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 7503 SdHoareTripleChecker+Invalid, 4966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 4590 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:51,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 7503 Invalid, 4966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 4590 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2022-07-22 23:52:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2022-07-22 23:52:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 7416. [2022-07-22 23:52:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7416 states, 5880 states have (on average 1.3714285714285714) internal successors, (8064), 5963 states have internal predecessors, (8064), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-22 23:52:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 10215 transitions. [2022-07-22 23:52:52,387 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 10215 transitions. Word has length 268 [2022-07-22 23:52:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:52,387 INFO L495 AbstractCegarLoop]: Abstraction has 7416 states and 10215 transitions. [2022-07-22 23:52:52,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-22 23:52:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 10215 transitions. [2022-07-22 23:52:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-22 23:52:52,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:52,398 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:52,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 23:52:52,398 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1797631130, now seen corresponding path program 1 times [2022-07-22 23:52:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:52,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038864568] [2022-07-22 23:52:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:52:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 23:52:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:52:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:52:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:52:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 23:52:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 23:52:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-22 23:52:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-22 23:52:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-22 23:52:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-22 23:52:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-22 23:52:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038864568] [2022-07-22 23:52:52,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038864568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224917700] [2022-07-22 23:52:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:52,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:52,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:52,856 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-22 23:52:52,857 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-22 23:52:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:53,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 2286 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 23:52:53,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-22 23:52:53,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:53,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224917700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:53,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:53,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-22 23:52:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486132593] [2022-07-22 23:52:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:53,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:52:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:52:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:52:53,533 INFO L87 Difference]: Start difference. First operand 7416 states and 10215 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:52:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:52:53,994 INFO L93 Difference]: Finished difference Result 14801 states and 20390 transitions. [2022-07-22 23:52:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:52:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-22 23:52:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:52:54,009 INFO L225 Difference]: With dead ends: 14801 [2022-07-22 23:52:54,009 INFO L226 Difference]: Without dead ends: 7415 [2022-07-22 23:52:54,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:52:54,029 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 6 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:52:54,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4099 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:52:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2022-07-22 23:52:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 7415. [2022-07-22 23:52:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 5879 states have (on average 1.3711515563871406) internal successors, (8061), 5962 states have internal predecessors, (8061), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-22 23:52:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 10212 transitions. [2022-07-22 23:52:54,416 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 10212 transitions. Word has length 274 [2022-07-22 23:52:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:52:54,417 INFO L495 AbstractCegarLoop]: Abstraction has 7415 states and 10212 transitions. [2022-07-22 23:52:54,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:52:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 10212 transitions. [2022-07-22 23:52:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-22 23:52:54,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:52:54,425 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:52:54,457 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-22 23:52:54,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:54,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:52:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:52:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 925220568, now seen corresponding path program 1 times [2022-07-22 23:52:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:52:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638697392] [2022-07-22 23:52:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:52:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:52:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:52:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:52:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:52:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:52:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:52:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:52:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:52:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:52:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:52:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:52:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:52:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:52:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:52:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:54,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 23:52:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:52:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:52:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:52:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 23:52:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 23:52:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-22 23:52:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-22 23:52:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:52:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-22 23:52:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:52:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-22 23:52:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-22 23:52:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:52:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638697392] [2022-07-22 23:52:55,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638697392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:52:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234179351] [2022-07-22 23:52:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:52:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:52:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:52:55,093 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-22 23:52:55,094 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-22 23:52:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:52:55,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 23:52:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:52:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-07-22 23:52:55,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:52:55,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234179351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:52:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:52:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-22 23:52:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708794515] [2022-07-22 23:52:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:52:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:52:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:52:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:52:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:52:55,896 INFO L87 Difference]: Start difference. First operand 7415 states and 10212 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:52:58,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:00,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:01,239 INFO L93 Difference]: Finished difference Result 16478 states and 23122 transitions. [2022-07-22 23:53:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:53:01,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-22 23:53:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:01,256 INFO L225 Difference]: With dead ends: 16478 [2022-07-22 23:53:01,256 INFO L226 Difference]: Without dead ends: 9143 [2022-07-22 23:53:01,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:53:01,266 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 297 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:01,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 4650 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-07-22 23:53:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9143 states. [2022-07-22 23:53:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9143 to 7745. [2022-07-22 23:53:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 6191 states have (on average 1.3824907123243417) internal successors, (8559), 6274 states have internal predecessors, (8559), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 536 states have return successors, (1170), 1050 states have call predecessors, (1170), 1016 states have call successors, (1170) [2022-07-22 23:53:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 10746 transitions. [2022-07-22 23:53:01,671 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 10746 transitions. Word has length 274 [2022-07-22 23:53:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:01,671 INFO L495 AbstractCegarLoop]: Abstraction has 7745 states and 10746 transitions. [2022-07-22 23:53:01,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:53:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 10746 transitions. [2022-07-22 23:53:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-22 23:53:01,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:01,676 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:01,697 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-22 23:53:01,877 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,SelfDestructingSolverStorable14 [2022-07-22 23:53:01,878 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash -132617510, now seen corresponding path program 1 times [2022-07-22 23:53:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:53:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962939208] [2022-07-22 23:53:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:53:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:53:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:53:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:53:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:53:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:53:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:53:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:53:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:53:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:53:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:53:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:53:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:53:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:53:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 23:53:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:53:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:53:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:53:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 23:53:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 23:53:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-22 23:53:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-22 23:53:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:53:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-22 23:53:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-22 23:53:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2022-07-22 23:53:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:53:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962939208] [2022-07-22 23:53:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962939208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:02,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:02,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 23:53:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522504124] [2022-07-22 23:53:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:02,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 23:53:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:53:02,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 23:53:02,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:53:02,438 INFO L87 Difference]: Start difference. First operand 7745 states and 10746 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:53:06,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:08,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:11,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:14,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:14,079 INFO L93 Difference]: Finished difference Result 18286 states and 25832 transitions. [2022-07-22 23:53:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:53:14,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-07-22 23:53:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:14,102 INFO L225 Difference]: With dead ends: 18286 [2022-07-22 23:53:14,102 INFO L226 Difference]: Without dead ends: 10621 [2022-07-22 23:53:14,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:53:14,113 INFO L413 NwaCegarLoop]: 1293 mSDtfsCounter, 1140 mSDsluCounter, 4499 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 431 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 5792 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:14,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 5792 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 2937 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2022-07-22 23:53:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2022-07-22 23:53:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 7781. [2022-07-22 23:53:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7781 states, 6221 states have (on average 1.3806461983603922) internal successors, (8589), 6304 states have internal predecessors, (8589), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 542 states have return successors, (1188), 1056 states have call predecessors, (1188), 1016 states have call successors, (1188) [2022-07-22 23:53:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7781 states to 7781 states and 10794 transitions. [2022-07-22 23:53:14,508 INFO L78 Accepts]: Start accepts. Automaton has 7781 states and 10794 transitions. Word has length 274 [2022-07-22 23:53:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:14,508 INFO L495 AbstractCegarLoop]: Abstraction has 7781 states and 10794 transitions. [2022-07-22 23:53:14,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:53:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 10794 transitions. [2022-07-22 23:53:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-22 23:53:14,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:14,513 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:14,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 23:53:14,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2052785736, now seen corresponding path program 1 times [2022-07-22 23:53:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:53:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483533129] [2022-07-22 23:53:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:53:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:53:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:53:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:53:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:53:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:53:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:53:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:53:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:53:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:53:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:53:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:53:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:53:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:53:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 23:53:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:53:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:53:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:53:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 23:53:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 23:53:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-22 23:53:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-22 23:53:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:53:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-22 23:53:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-22 23:53:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-07-22 23:53:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:53:15,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483533129] [2022-07-22 23:53:15,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483533129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:53:15,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:53:15,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-22 23:53:15,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667027079] [2022-07-22 23:53:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:53:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 23:53:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:53:15,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 23:53:15,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-22 23:53:15,198 INFO L87 Difference]: Start difference. First operand 7781 states and 10794 transitions. Second operand has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-22 23:53:20,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:22,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:26,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:28,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:31,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:33,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:53:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:53:33,541 INFO L93 Difference]: Finished difference Result 22431 states and 32470 transitions. [2022-07-22 23:53:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 23:53:33,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 275 [2022-07-22 23:53:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:53:33,574 INFO L225 Difference]: With dead ends: 22431 [2022-07-22 23:53:33,574 INFO L226 Difference]: Without dead ends: 14730 [2022-07-22 23:53:33,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-07-22 23:53:33,590 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 2071 mSDsluCounter, 13322 mSDsCounter, 0 mSdLazyCounter, 7950 mSolverCounterSat, 581 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 14863 SdHoareTripleChecker+Invalid, 8537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 7950 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:53:33,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 14863 Invalid, 8537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 7950 Invalid, 6 Unknown, 0 Unchecked, 17.4s Time] [2022-07-22 23:53:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-07-22 23:53:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 7811. [2022-07-22 23:53:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 6245 states have (on average 1.37822257806245) internal successors, (8607), 6328 states have internal predecessors, (8607), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 548 states have return successors, (1194), 1062 states have call predecessors, (1194), 1016 states have call successors, (1194) [2022-07-22 23:53:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 10818 transitions. [2022-07-22 23:53:34,130 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 10818 transitions. Word has length 275 [2022-07-22 23:53:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:53:34,130 INFO L495 AbstractCegarLoop]: Abstraction has 7811 states and 10818 transitions. [2022-07-22 23:53:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-22 23:53:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 10818 transitions. [2022-07-22 23:53:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-22 23:53:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:53:34,137 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:53:34,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 23:53:34,138 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:53:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:53:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -580629637, now seen corresponding path program 1 times [2022-07-22 23:53:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:53:34,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413153928] [2022-07-22 23:53:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:53:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:53:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:53:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:53:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:53:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:53:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:53:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:53:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:53:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:53:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 23:53:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:53:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:53:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:53:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:53:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 23:53:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 23:53:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:53:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:53:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 23:53:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 23:53:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-22 23:53:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-22 23:53:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:53:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-22 23:53:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:53:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-22 23:53:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-22 23:53:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:53:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413153928] [2022-07-22 23:53:36,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413153928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:53:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085775547] [2022-07-22 23:53:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:53:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:53:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:53:36,288 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-22 23:53:36,289 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-22 23:53:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:53:37,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 186 conjunts are in the unsatisfiable core [2022-07-22 23:53:37,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:53:37,793 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-22 23:53:37,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-07-22 23:53:37,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 23:53:37,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-07-22 23:53:38,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 23:53:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:38,271 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-22 23:53:38,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 37 [2022-07-22 23:53:39,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:39,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:39,889 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-22 23:53:39,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2022-07-22 23:53:40,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:40,823 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-22 23:53:40,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2022-07-22 23:53:41,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:41,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:41,275 INFO L356 Elim1Store]: treesize reduction 94, result has 43.0 percent of original size [2022-07-22 23:53:41,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 54 treesize of output 110 [2022-07-22 23:53:41,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:41,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:41,822 INFO L356 Elim1Store]: treesize reduction 46, result has 51.6 percent of original size [2022-07-22 23:53:41,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 111 [2022-07-22 23:53:42,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:53:42,392 INFO L356 Elim1Store]: treesize reduction 33, result has 47.6 percent of original size [2022-07-22 23:53:42,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 64 [2022-07-22 23:53:42,408 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 23:53:42,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 23:53:43,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 23:53:43,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 44 [2022-07-22 23:53:43,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 23:53:43,971 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 7 treesize of output 6 [2022-07-22 23:53:44,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 23:53:50,565 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 23:53:50,566 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 13 treesize of output 19 [2022-07-22 23:53:52,748 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 23:53:52,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 23:53:52,992 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 13 treesize of output 15 [2022-07-22 23:53:53,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 12 [2022-07-22 23:53:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 31 proven. 57 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-22 23:53:53,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:54:25,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-22 23:54:25,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-22 23:54:25,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret387#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-22 23:54:25,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-22 23:54:25,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 120 [2022-07-22 23:54:26,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 139 [2022-07-22 23:54:26,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 131 [2022-07-22 23:54:26,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2022-07-22 23:54:26,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2022-07-22 23:54:26,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085775547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:54:26,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:54:26,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 41] total 76 [2022-07-22 23:54:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106231560] [2022-07-22 23:54:26,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:54:26,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-22 23:54:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:54:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-22 23:54:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6616, Unknown=50, NotChecked=498, Total=7482 [2022-07-22 23:54:26,779 INFO L87 Difference]: Start difference. First operand 7811 states and 10818 transitions. Second operand has 76 states, 74 states have (on average 4.405405405405405) internal successors, (326), 63 states have internal predecessors, (326), 23 states have call successors, (57), 11 states have call predecessors, (57), 15 states have return successors, (56), 24 states have call predecessors, (56), 23 states have call successors, (56)