./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--wireless--at76c50x-usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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--wireless--at76c50x-usb.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 d88455bf5089be24833f69dfcbd91003e7e136bcd5efcd63ae18e59d7f59e87d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:18:36,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:18:36,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:18:36,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:18:36,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:18:36,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:18:36,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:18:36,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:18:36,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:18:36,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:18:36,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:18:36,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:18:36,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:18:36,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:18:36,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:18:36,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:18:36,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:18:36,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:18:36,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:18:36,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:18:36,885 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:18:36,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:18:36,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:18:36,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:18:36,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:18:36,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:18:36,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:18:36,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:18:36,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:18:36,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:18:36,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:18:36,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:18:36,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:18:36,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:18:36,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:18:36,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:18:36,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:18:36,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:18:36,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:18:36,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:18:36,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:18:36,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:18:36,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:18:36,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:18:36,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:18:36,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:18:36,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:18:36,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:18:36,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:18:36,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:18:36,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:18:36,925 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:18:36,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:18:36,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:18:36,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:18:36,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:18:36,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:18:36,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:18:36,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:18:36,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:18:36,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:18:36,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:18:36,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:18:36,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:18:36,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:18:36,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:18:36,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:18:36,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:18:36,929 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 -> d88455bf5089be24833f69dfcbd91003e7e136bcd5efcd63ae18e59d7f59e87d [2022-07-14 00:18:37,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:18:37,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:18:37,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:18:37,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:18:37,141 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:18:37,142 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--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-14 00:18:37,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dbbcdaee/e58f697582d043cf9d9d3038598f4b30/FLAGd31e4da7a [2022-07-14 00:18:37,900 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:18:37,900 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--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-14 00:18:37,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dbbcdaee/e58f697582d043cf9d9d3038598f4b30/FLAGd31e4da7a [2022-07-14 00:18:38,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dbbcdaee/e58f697582d043cf9d9d3038598f4b30 [2022-07-14 00:18:38,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:18:38,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:18:38,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:18:38,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:18:38,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:18:38,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:18:38" (1/1) ... [2022-07-14 00:18:38,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3ff34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:38, skipping insertion in model container [2022-07-14 00:18:38,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:18:38" (1/1) ... [2022-07-14 00:18:38,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:18:38,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:18:39,082 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--wireless--at76c50x-usb.ko-entry_point.cil.out.i[205251,205264] [2022-07-14 00:18:39,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:18:39,981 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:18:40,113 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--wireless--at76c50x-usb.ko-entry_point.cil.out.i[205251,205264] [2022-07-14 00:18:40,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:18:40,346 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:18:40,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40 WrapperNode [2022-07-14 00:18:40,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:18:40,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:18:40,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:18:40,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:18:40,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,633 INFO L137 Inliner]: procedures = 239, calls = 2983, calls flagged for inlining = 111, calls inlined = 96, statements flattened = 5266 [2022-07-14 00:18:40,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:18:40,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:18:40,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:18:40,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:18:40,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:18:40,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:18:40,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:18:40,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:18:40,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (1/1) ... [2022-07-14 00:18:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:18:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:18:40,894 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-14 00:18:40,912 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-14 00:18:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure at76_hw_scan [2022-07-14 00:18:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_hw_scan [2022-07-14 00:18:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure at76_dfu_get_status [2022-07-14 00:18:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_dfu_get_status [2022-07-14 00:18:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure at76_join [2022-07-14 00:18:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_join [2022-07-14 00:18:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-14 00:18:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-14 00:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:18:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2022-07-14 00:18:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2022-07-14 00:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure at76_submit_rx_urb [2022-07-14 00:18:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_submit_rx_urb [2022-07-14 00:18:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure at76_add_interface [2022-07-14 00:18:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_add_interface [2022-07-14 00:18:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_timeout [2022-07-14 00:18:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_timeout [2022-07-14 00:18:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:18:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:18:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-14 00:18:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-14 00:18:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure at76_bss_info_changed [2022-07-14 00:18:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_bss_info_changed [2022-07-14 00:18:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure at76_wait_completion [2022-07-14 00:18:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_wait_completion [2022-07-14 00:18:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-14 00:18:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-14 00:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-14 00:18:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-14 00:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:18:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 00:18:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 00:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:18:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:18:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:18:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 00:18:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 00:18:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:18:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-14 00:18:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-14 00:18:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure at76_delete_device [2022-07-14 00:18:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_delete_device [2022-07-14 00:18:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-07-14 00:18:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_mib [2022-07-14 00:18:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_mib [2022-07-14 00:18:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_radio [2022-07-14 00:18:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_radio [2022-07-14 00:18:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:18:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:18:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure led_trigger_event [2022-07-14 00:18:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure led_trigger_event [2022-07-14 00:18:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_card_command [2022-07-14 00:18:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_card_command [2022-07-14 00:18:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_cmd_status [2022-07-14 00:18:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_cmd_status [2022-07-14 00:18:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-14 00:18:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-14 00:18:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-14 00:18:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-14 00:18:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:18:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:18:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_delayed_work [2022-07-14 00:18:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_delayed_work [2022-07-14 00:18:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-14 00:18:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-14 00:18:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-14 00:18:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-14 00:18:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-14 00:18:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-14 00:18:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_mib [2022-07-14 00:18:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_mib [2022-07-14 00:18:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-14 00:18:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-14 00:18:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:18:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:18:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:18:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:18:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_pm_mode [2022-07-14 00:18:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_pm_mode [2022-07-14 00:18:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure at76_set_key [2022-07-14 00:18:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_set_key [2022-07-14 00:18:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure at76_is_505a [2022-07-14 00:18:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_is_505a [2022-07-14 00:18:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:18:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_hw_cfg [2022-07-14 00:18:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_hw_cfg [2022-07-14 00:18:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure at76_config [2022-07-14 00:18:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_config [2022-07-14 00:18:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-14 00:18:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-14 00:18:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:18:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:18:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-14 00:18:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-14 00:18:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 00:18:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 00:18:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-14 00:18:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-14 00:18:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 00:18:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 00:18:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure at76_get_op_mode [2022-07-14 00:18:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_get_op_mode [2022-07-14 00:18:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure at76_remove_interface [2022-07-14 00:18:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_remove_interface [2022-07-14 00:18:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure print_hex_dump [2022-07-14 00:18:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure print_hex_dump [2022-07-14 00:18:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:18:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:18:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:18:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:18:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:18:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure wiphy_name [2022-07-14 00:18:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure wiphy_name [2022-07-14 00:18:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-14 00:18:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-14 00:18:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:18:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure at76_start_monitor [2022-07-14 00:18:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_start_monitor [2022-07-14 00:18:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_stop_queues [2022-07-14 00:18:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_stop_queues [2022-07-14 00:18:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-14 00:18:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-14 00:18:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:18:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-14 00:18:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-14 00:18:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:18:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 00:18:40,941 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 00:18:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-14 00:18:40,941 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-14 00:18:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-14 00:18:40,941 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-14 00:18:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-14 00:18:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-14 00:18:40,942 INFO L130 BoogieDeclarations]: Found specification of procedure at76_configure_filter [2022-07-14 00:18:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_configure_filter [2022-07-14 00:18:40,942 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 00:18:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 00:18:40,942 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_work [2022-07-14 00:18:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_work [2022-07-14 00:18:40,942 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-14 00:18:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-14 00:18:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:18:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure at76_mac80211_tx [2022-07-14 00:18:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure at76_mac80211_tx [2022-07-14 00:18:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:18:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:18:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure IEEE80211_SKB_CB [2022-07-14 00:18:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IEEE80211_SKB_CB [2022-07-14 00:18:41,663 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:18:41,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:18:41,889 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:18:49,918 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:18:49,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:18:49,935 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 00:18:49,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:18:49 BoogieIcfgContainer [2022-07-14 00:18:49,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:18:49,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:18:49,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:18:49,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:18:49,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:18:38" (1/3) ... [2022-07-14 00:18:49,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f5d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:18:49, skipping insertion in model container [2022-07-14 00:18:49,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:18:40" (2/3) ... [2022-07-14 00:18:49,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f5d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:18:49, skipping insertion in model container [2022-07-14 00:18:49,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:18:49" (3/3) ... [2022-07-14 00:18:49,945 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--at76c50x-usb.ko-entry_point.cil.out.i [2022-07-14 00:18:49,958 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:18:49,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:18:50,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:18:50,040 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@71879ef5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5807ad6c [2022-07-14 00:18:50,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:18:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 1344 states, 979 states have (on average 1.390194075587334) internal successors, (1361), 1003 states have internal predecessors, (1361), 296 states have call successors, (296), 68 states have call predecessors, (296), 67 states have return successors, (291), 290 states have call predecessors, (291), 291 states have call successors, (291) [2022-07-14 00:18:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 00:18:50,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:18:50,058 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-14 00:18:50,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:18:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:18:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash -576681096, now seen corresponding path program 1 times [2022-07-14 00:18:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:18:50,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040374230] [2022-07-14 00:18:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:18:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:18:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:18:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:18:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:18:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:18:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:18:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:18:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:18:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:18:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:18:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:18:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:18:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-14 00:18:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:18:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040374230] [2022-07-14 00:18:50,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040374230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:18:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:18:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:18:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291160617] [2022-07-14 00:18:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:18:50,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:18:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:18:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:18:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:18:50,871 INFO L87 Difference]: Start difference. First operand has 1344 states, 979 states have (on average 1.390194075587334) internal successors, (1361), 1003 states have internal predecessors, (1361), 296 states have call successors, (296), 68 states have call predecessors, (296), 67 states have return successors, (291), 290 states have call predecessors, (291), 291 states have call successors, (291) Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (11), 3 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-14 00:18:57,820 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-14 00:18:59,847 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-14 00:19:01,884 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-14 00:19:03,912 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-14 00:19:06,339 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-14 00:19:08,363 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-14 00:19:10,398 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-14 00:19:12,430 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-14 00:19:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:19:13,271 INFO L93 Difference]: Finished difference Result 4281 states and 6544 transitions. [2022-07-14 00:19:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:19:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (11), 3 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 80 [2022-07-14 00:19:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:19:13,307 INFO L225 Difference]: With dead ends: 4281 [2022-07-14 00:19:13,307 INFO L226 Difference]: Without dead ends: 2924 [2022-07-14 00:19:13,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:19:13,329 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 2910 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 1542 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3162 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1542 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:19:13,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3162 Valid, 5442 Invalid, 3982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1542 Valid, 2432 Invalid, 8 Unknown, 0 Unchecked, 22.0s Time] [2022-07-14 00:19:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2022-07-14 00:19:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2610. [2022-07-14 00:19:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 1910 states have (on average 1.382198952879581) internal successors, (2640), 1944 states have internal predecessors, (2640), 567 states have call successors, (567), 133 states have call predecessors, (567), 132 states have return successors, (566), 564 states have call predecessors, (566), 566 states have call successors, (566) [2022-07-14 00:19:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3773 transitions. [2022-07-14 00:19:13,576 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3773 transitions. Word has length 80 [2022-07-14 00:19:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:19:13,578 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 3773 transitions. [2022-07-14 00:19:13,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (11), 3 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-14 00:19:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3773 transitions. [2022-07-14 00:19:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-14 00:19:13,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:19:13,593 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-14 00:19:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:19:13,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:19:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:19:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2085975567, now seen corresponding path program 1 times [2022-07-14 00:19:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:19:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110202598] [2022-07-14 00:19:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:19:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:19:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:19:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:19:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:19:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:19:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:19:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:19:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:19:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:19:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:19:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:19:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:19:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:19:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:19:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:19:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110202598] [2022-07-14 00:19:14,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110202598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:19:14,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:19:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:19:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970640255] [2022-07-14 00:19:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:19:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:19:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:19:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:19:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:19:14,280 INFO L87 Difference]: Start difference. First operand 2610 states and 3773 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 00:19:21,671 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-14 00:19:23,691 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-14 00:19:24,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:19:26,872 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-14 00:19:28,936 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-14 00:19:30,963 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-14 00:19:32,992 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-14 00:19:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:19:34,093 INFO L93 Difference]: Finished difference Result 8399 states and 12489 transitions. [2022-07-14 00:19:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:19:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2022-07-14 00:19:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:19:34,121 INFO L225 Difference]: With dead ends: 8399 [2022-07-14 00:19:34,121 INFO L226 Difference]: Without dead ends: 5803 [2022-07-14 00:19:34,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:19:34,131 INFO L413 NwaCegarLoop]: 2101 mSDtfsCounter, 3045 mSDsluCounter, 6183 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 1584 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3307 SdHoareTripleChecker+Valid, 8284 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1584 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:19:34,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3307 Valid, 8284 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1584 Valid, 4092 Invalid, 6 Unknown, 0 Unchecked, 19.4s Time] [2022-07-14 00:19:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2022-07-14 00:19:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5213. [2022-07-14 00:19:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5213 states, 3819 states have (on average 1.3833464257659074) internal successors, (5283), 3889 states have internal predecessors, (5283), 1123 states have call successors, (1123), 265 states have call predecessors, (1123), 270 states have return successors, (1143), 1122 states have call predecessors, (1143), 1122 states have call successors, (1143) [2022-07-14 00:19:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 7549 transitions. [2022-07-14 00:19:34,306 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 7549 transitions. Word has length 96 [2022-07-14 00:19:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:19:34,308 INFO L495 AbstractCegarLoop]: Abstraction has 5213 states and 7549 transitions. [2022-07-14 00:19:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 00:19:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 7549 transitions. [2022-07-14 00:19:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 00:19:34,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:19:34,319 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-14 00:19:34,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:19:34,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:19:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:19:34,320 INFO L85 PathProgramCache]: Analyzing trace with hash -178635968, now seen corresponding path program 1 times [2022-07-14 00:19:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:19:34,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816250510] [2022-07-14 00:19:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:19:34,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:19:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:19:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:19:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:19:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:19:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:19:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:19:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:19:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:19:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:19:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:19:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 00:19:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:19:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:19:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:19:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:19:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:19:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:19:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-14 00:19:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:19:34,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816250510] [2022-07-14 00:19:34,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816250510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:19:34,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:19:34,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:19:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824409497] [2022-07-14 00:19:34,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:19:34,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:19:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:19:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:19:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:19:34,736 INFO L87 Difference]: Start difference. First operand 5213 states and 7549 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:19:39,618 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-14 00:19:41,643 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-14 00:19:43,681 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-14 00:19:45,708 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-14 00:19:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:19:47,048 INFO L93 Difference]: Finished difference Result 13361 states and 19664 transitions. [2022-07-14 00:19:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:19:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2022-07-14 00:19:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:19:47,088 INFO L225 Difference]: With dead ends: 13361 [2022-07-14 00:19:47,088 INFO L226 Difference]: Without dead ends: 8172 [2022-07-14 00:19:47,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:19:47,103 INFO L413 NwaCegarLoop]: 2004 mSDtfsCounter, 1923 mSDsluCounter, 3149 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 1417 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1417 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:19:47,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2070 Valid, 5153 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1417 Valid, 2140 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2022-07-14 00:19:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2022-07-14 00:19:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7472. [2022-07-14 00:19:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 5511 states have (on average 1.3796044275086192) internal successors, (7603), 5597 states have internal predecessors, (7603), 1550 states have call successors, (1550), 397 states have call predecessors, (1550), 410 states have return successors, (1586), 1549 states have call predecessors, (1586), 1549 states have call successors, (1586) [2022-07-14 00:19:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 10739 transitions. [2022-07-14 00:19:47,325 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 10739 transitions. Word has length 144 [2022-07-14 00:19:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:19:47,327 INFO L495 AbstractCegarLoop]: Abstraction has 7472 states and 10739 transitions. [2022-07-14 00:19:47,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:19:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 10739 transitions. [2022-07-14 00:19:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 00:19:47,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:19:47,333 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-14 00:19:47,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:19:47,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:19:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:19:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -157674826, now seen corresponding path program 1 times [2022-07-14 00:19:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:19:47,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107006175] [2022-07-14 00:19:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:19:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:19:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:19:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:19:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:19:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:19:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:19:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:19:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:19:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:19:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:19:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:19:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 00:19:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:19:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 00:19:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:19:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:19:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:19:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:19:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:19:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:19:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:19:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:19:47,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107006175] [2022-07-14 00:19:47,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107006175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:19:47,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:19:47,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:19:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641608267] [2022-07-14 00:19:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:19:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:19:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:19:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:19:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:19:47,756 INFO L87 Difference]: Start difference. First operand 7472 states and 10739 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 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-14 00:19:55,603 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-14 00:19:57,626 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-14 00:19:59,655 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-14 00:20:01,703 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-14 00:20:03,733 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-14 00:20:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:20:05,919 INFO L93 Difference]: Finished difference Result 19747 states and 28972 transitions. [2022-07-14 00:20:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:20:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 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 156 [2022-07-14 00:20:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:20:05,987 INFO L225 Difference]: With dead ends: 19747 [2022-07-14 00:20:05,987 INFO L226 Difference]: Without dead ends: 12310 [2022-07-14 00:20:06,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:20:06,044 INFO L413 NwaCegarLoop]: 2819 mSDtfsCounter, 2003 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 5148 mSolverCounterSat, 1016 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 8469 SdHoareTripleChecker+Invalid, 6169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 5148 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:20:06,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 8469 Invalid, 6169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 5148 Invalid, 5 Unknown, 0 Unchecked, 17.8s Time] [2022-07-14 00:20:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12310 states. [2022-07-14 00:20:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12310 to 10938. [2022-07-14 00:20:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10938 states, 8034 states have (on average 1.3783918347025144) internal successors, (11074), 8182 states have internal predecessors, (11074), 2278 states have call successors, (2278), 606 states have call predecessors, (2278), 625 states have return successors, (2324), 2277 states have call predecessors, (2324), 2277 states have call successors, (2324) [2022-07-14 00:20:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 15676 transitions. [2022-07-14 00:20:06,333 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 15676 transitions. Word has length 156 [2022-07-14 00:20:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:20:06,334 INFO L495 AbstractCegarLoop]: Abstraction has 10938 states and 15676 transitions. [2022-07-14 00:20:06,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 7 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-14 00:20:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 15676 transitions. [2022-07-14 00:20:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 00:20:06,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:20:06,343 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 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] [2022-07-14 00:20:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:20:06,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:20:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:20:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash -67194308, now seen corresponding path program 1 times [2022-07-14 00:20:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:20:06,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223534848] [2022-07-14 00:20:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:20:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:20:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:20:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:20:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:20:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:20:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:20:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:20:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:20:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:20:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:20:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:20:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:20:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:20:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:20:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:20:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:20:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:20:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:20:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:20:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:20:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-14 00:20:06,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:20:06,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223534848] [2022-07-14 00:20:06,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223534848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:20:06,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:20:06,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:20:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671747523] [2022-07-14 00:20:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:20:06,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:20:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:20:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:20:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:20:06,723 INFO L87 Difference]: Start difference. First operand 10938 states and 15676 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:20:12,479 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-14 00:20:14,507 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-14 00:20:16,534 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-14 00:20:18,571 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-14 00:20:20,600 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-14 00:20:22,627 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-14 00:20:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:20:23,775 INFO L93 Difference]: Finished difference Result 17155 states and 24873 transitions. [2022-07-14 00:20:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:20:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2022-07-14 00:20:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:20:23,795 INFO L225 Difference]: With dead ends: 17155 [2022-07-14 00:20:23,795 INFO L226 Difference]: Without dead ends: 6244 [2022-07-14 00:20:23,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 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-14 00:20:23,817 INFO L413 NwaCegarLoop]: 1836 mSDtfsCounter, 425 mSDsluCounter, 6582 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 356 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 8418 SdHoareTripleChecker+Invalid, 4246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:20:23,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 8418 Invalid, 4246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 3884 Invalid, 6 Unknown, 0 Unchecked, 16.8s Time] [2022-07-14 00:20:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6244 states. [2022-07-14 00:20:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6244 to 5552. [2022-07-14 00:20:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5552 states, 4083 states have (on average 1.3771736468283124) internal successors, (5623), 4155 states have internal predecessors, (5623), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 319 states have return successors, (1172), 1150 states have call predecessors, (1172), 1148 states have call successors, (1172) [2022-07-14 00:20:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 7944 transitions. [2022-07-14 00:20:23,966 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 7944 transitions. Word has length 168 [2022-07-14 00:20:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:20:23,967 INFO L495 AbstractCegarLoop]: Abstraction has 5552 states and 7944 transitions. [2022-07-14 00:20:23,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:20:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 7944 transitions. [2022-07-14 00:20:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 00:20:23,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:20:23,973 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 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] [2022-07-14 00:20:23,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:20:23,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:20:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:20:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1257661886, now seen corresponding path program 1 times [2022-07-14 00:20:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:20:23,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237778977] [2022-07-14 00:20:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:20:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:20:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:20:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:20:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:20:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:20:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:20:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:20:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:20:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:20:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:20:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:20:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:20:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:20:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:20:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:20:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:20:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:20:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:20:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:20:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:20:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-14 00:20:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:20:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237778977] [2022-07-14 00:20:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237778977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:20:24,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:20:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:20:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353348318] [2022-07-14 00:20:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:20:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:20:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:20:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:20:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:20:24,375 INFO L87 Difference]: Start difference. First operand 5552 states and 7944 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:20:30,247 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-14 00:20:32,279 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-14 00:20:34,304 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-14 00:20:36,342 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-14 00:20:38,369 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-14 00:20:40,410 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-14 00:20:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:20:41,380 INFO L93 Difference]: Finished difference Result 11657 states and 17017 transitions. [2022-07-14 00:20:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:20:41,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2022-07-14 00:20:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:20:41,398 INFO L225 Difference]: With dead ends: 11657 [2022-07-14 00:20:41,398 INFO L226 Difference]: Without dead ends: 6179 [2022-07-14 00:20:41,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:20:41,410 INFO L413 NwaCegarLoop]: 1842 mSDtfsCounter, 406 mSDsluCounter, 3848 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 352 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 5690 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:20:41,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 5690 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2654 Invalid, 6 Unknown, 0 Unchecked, 16.8s Time] [2022-07-14 00:20:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-14 00:20:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5556. [2022-07-14 00:20:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4087 states have (on average 1.3763151455835576) internal successors, (5625), 4159 states have internal predecessors, (5625), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 319 states have return successors, (1172), 1150 states have call predecessors, (1172), 1148 states have call successors, (1172) [2022-07-14 00:20:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7946 transitions. [2022-07-14 00:20:41,591 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7946 transitions. Word has length 168 [2022-07-14 00:20:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:20:41,592 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 7946 transitions. [2022-07-14 00:20:41,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:20:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7946 transitions. [2022-07-14 00:20:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 00:20:41,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:20:41,600 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 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] [2022-07-14 00:20:41,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:20:41,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:20:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:20:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -128541508, now seen corresponding path program 1 times [2022-07-14 00:20:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:20:41,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34105372] [2022-07-14 00:20:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:20:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:20:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:20:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:20:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:20:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:20:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:20:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:20:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:20:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:20:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:20:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:20:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:20:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:20:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:20:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:20:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:20:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:20:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:20:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:20:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:20:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:20:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-14 00:20:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:20:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34105372] [2022-07-14 00:20:42,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34105372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:20:42,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:20:42,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:20:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823950803] [2022-07-14 00:20:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:20:42,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:20:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:20:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:20:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:20:42,041 INFO L87 Difference]: Start difference. First operand 5556 states and 7946 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 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-14 00:20:48,104 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-14 00:20:50,133 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-14 00:20:52,166 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-14 00:20:54,212 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-14 00:20:56,250 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-14 00:20:58,277 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-14 00:20:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:20:59,635 INFO L93 Difference]: Finished difference Result 11625 states and 16971 transitions. [2022-07-14 00:20:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:20:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 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 168 [2022-07-14 00:20:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:20:59,655 INFO L225 Difference]: With dead ends: 11625 [2022-07-14 00:20:59,656 INFO L226 Difference]: Without dead ends: 6143 [2022-07-14 00:20:59,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:20:59,666 INFO L413 NwaCegarLoop]: 1876 mSDtfsCounter, 393 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 352 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 8488 SdHoareTripleChecker+Invalid, 4325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:20:59,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 8488 Invalid, 4325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 3967 Invalid, 6 Unknown, 0 Unchecked, 17.3s Time] [2022-07-14 00:20:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2022-07-14 00:20:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5556. [2022-07-14 00:20:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4083 states have (on average 1.3747244673034533) internal successors, (5613), 4157 states have internal predecessors, (5613), 1149 states have call successors, (1149), 310 states have call predecessors, (1149), 323 states have return successors, (1178), 1152 states have call predecessors, (1178), 1148 states have call successors, (1178) [2022-07-14 00:20:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7940 transitions. [2022-07-14 00:20:59,852 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7940 transitions. Word has length 168 [2022-07-14 00:20:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:20:59,852 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 7940 transitions. [2022-07-14 00:20:59,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 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-14 00:20:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7940 transitions. [2022-07-14 00:20:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 00:20:59,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:20:59,862 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 3, 3, 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] [2022-07-14 00:20:59,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:20:59,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:20:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:20:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash -54204084, now seen corresponding path program 1 times [2022-07-14 00:20:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:20:59,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826323303] [2022-07-14 00:20:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:20:59,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:20:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:21:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:21:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:21:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:21:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:21:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:21:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:21:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:21:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:21:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:21:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:21:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:21:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:21:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:21:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:21:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:21:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:21:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-14 00:21:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:21:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826323303] [2022-07-14 00:21:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826323303] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:21:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065662397] [2022-07-14 00:21:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:21:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:21:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:21:00,400 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-14 00:21:00,404 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-14 00:21:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:01,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 5248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:21:01,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:21:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-14 00:21:01,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:21:01,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065662397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:21:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:21:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-07-14 00:21:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846306755] [2022-07-14 00:21:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:21:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:21:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:21:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:21:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:21:01,527 INFO L87 Difference]: Start difference. First operand 5556 states and 7940 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:21:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:21:02,936 INFO L93 Difference]: Finished difference Result 16519 states and 23627 transitions. [2022-07-14 00:21:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:21:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2022-07-14 00:21:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:21:02,985 INFO L225 Difference]: With dead ends: 16519 [2022-07-14 00:21:02,985 INFO L226 Difference]: Without dead ends: 16506 [2022-07-14 00:21:02,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:21:02,996 INFO L413 NwaCegarLoop]: 4077 mSDtfsCounter, 3703 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3703 SdHoareTripleChecker+Valid, 7286 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:21:02,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3703 Valid, 7286 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 00:21:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2022-07-14 00:21:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 16472. [2022-07-14 00:21:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16472 states, 12095 states have (on average 1.3770152955766846) internal successors, (16655), 12325 states have internal predecessors, (16655), 3417 states have call successors, (3417), 918 states have call predecessors, (3417), 959 states have return successors, (3506), 3420 states have call predecessors, (3506), 3416 states have call successors, (3506) [2022-07-14 00:21:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16472 states to 16472 states and 23578 transitions. [2022-07-14 00:21:03,503 INFO L78 Accepts]: Start accepts. Automaton has 16472 states and 23578 transitions. Word has length 175 [2022-07-14 00:21:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:21:03,503 INFO L495 AbstractCegarLoop]: Abstraction has 16472 states and 23578 transitions. [2022-07-14 00:21:03,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:21:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16472 states and 23578 transitions. [2022-07-14 00:21:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 00:21:03,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:21:03,522 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 3, 3, 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] [2022-07-14 00:21:03,574 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-14 00:21:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:21:03,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:21:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:21:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1642551986, now seen corresponding path program 1 times [2022-07-14 00:21:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:21:03,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768640074] [2022-07-14 00:21:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:21:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:21:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:21:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:21:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:21:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:21:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:21:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:21:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:21:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:21:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:21:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:21:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:21:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:21:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:21:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:21:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:21:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:21:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:21:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-14 00:21:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:21:04,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768640074] [2022-07-14 00:21:04,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768640074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:21:04,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:21:04,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:21:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3002241] [2022-07-14 00:21:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:21:04,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:21:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:21:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:21:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:21:04,164 INFO L87 Difference]: Start difference. First operand 16472 states and 23578 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-14 00:21:10,328 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-14 00:21:12,353 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-14 00:21:14,390 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-14 00:21:16,423 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-14 00:21:18,499 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-14 00:21:20,529 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-14 00:21:22,573 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-14 00:21:24,621 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-14 00:21:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:21:25,962 INFO L93 Difference]: Finished difference Result 40517 states and 60381 transitions. [2022-07-14 00:21:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:21:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 175 [2022-07-14 00:21:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:21:26,104 INFO L225 Difference]: With dead ends: 40517 [2022-07-14 00:21:26,104 INFO L226 Difference]: Without dead ends: 24119 [2022-07-14 00:21:26,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:21:26,142 INFO L413 NwaCegarLoop]: 2499 mSDtfsCounter, 3230 mSDsluCounter, 4242 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1451 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 6741 SdHoareTripleChecker+Invalid, 3761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1451 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:21:26,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3467 Valid, 6741 Invalid, 3761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1451 Valid, 2302 Invalid, 8 Unknown, 0 Unchecked, 21.1s Time] [2022-07-14 00:21:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24119 states. [2022-07-14 00:21:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24119 to 16460. [2022-07-14 00:21:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16460 states, 12083 states have (on average 1.3763965902507656) internal successors, (16631), 12317 states have internal predecessors, (16631), 3417 states have call successors, (3417), 918 states have call predecessors, (3417), 959 states have return successors, (3506), 3416 states have call predecessors, (3506), 3416 states have call successors, (3506) [2022-07-14 00:21:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16460 states to 16460 states and 23554 transitions. [2022-07-14 00:21:26,909 INFO L78 Accepts]: Start accepts. Automaton has 16460 states and 23554 transitions. Word has length 175 [2022-07-14 00:21:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:21:26,910 INFO L495 AbstractCegarLoop]: Abstraction has 16460 states and 23554 transitions. [2022-07-14 00:21:26,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-14 00:21:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 16460 states and 23554 transitions. [2022-07-14 00:21:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 00:21:26,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:21:26,929 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 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-14 00:21:26,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:21:26,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:21:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:21:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 25964212, now seen corresponding path program 1 times [2022-07-14 00:21:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:21:26,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176004354] [2022-07-14 00:21:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:21:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:21:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:21:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:21:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:21:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:21:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:21:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:21:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:21:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:21:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:21:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:21:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:21:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:21:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 00:21:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:21:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 00:21:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:21:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:21:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-14 00:21:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:21:27,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176004354] [2022-07-14 00:21:27,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176004354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:21:27,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:21:27,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:21:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786612092] [2022-07-14 00:21:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:21:27,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:21:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:21:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:21:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:21:27,398 INFO L87 Difference]: Start difference. First operand 16460 states and 23554 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:21:33,563 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-14 00:21:35,591 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-14 00:21:37,625 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-14 00:21:39,659 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-14 00:21:41,700 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-14 00:21:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:21:44,026 INFO L93 Difference]: Finished difference Result 41700 states and 60784 transitions. [2022-07-14 00:21:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:21:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 180 [2022-07-14 00:21:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:21:44,133 INFO L225 Difference]: With dead ends: 41700 [2022-07-14 00:21:44,133 INFO L226 Difference]: Without dead ends: 25314 [2022-07-14 00:21:44,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:21:44,172 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 3942 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 2593 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4243 SdHoareTripleChecker+Valid, 5714 SdHoareTripleChecker+Invalid, 6009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2593 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:21:44,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4243 Valid, 5714 Invalid, 6009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2593 Valid, 3411 Invalid, 5 Unknown, 0 Unchecked, 15.7s Time] [2022-07-14 00:21:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25314 states. [2022-07-14 00:21:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25314 to 22474. [2022-07-14 00:21:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22474 states, 16500 states have (on average 1.3717575757575757) internal successors, (22634), 16840 states have internal predecessors, (22634), 4606 states have call successors, (4606), 1292 states have call predecessors, (4606), 1367 states have return successors, (4762), 4626 states have call predecessors, (4762), 4605 states have call successors, (4762) [2022-07-14 00:21:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 32002 transitions. [2022-07-14 00:21:45,291 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 32002 transitions. Word has length 180 [2022-07-14 00:21:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:21:45,291 INFO L495 AbstractCegarLoop]: Abstraction has 22474 states and 32002 transitions. [2022-07-14 00:21:45,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-14 00:21:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 32002 transitions. [2022-07-14 00:21:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-14 00:21:45,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:21:45,309 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:21:45,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:21:45,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:21:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:21:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1562427333, now seen corresponding path program 1 times [2022-07-14 00:21:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:21:45,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687112245] [2022-07-14 00:21:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:21:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:21:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:21:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:21:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:21:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:21:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:21:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:21:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:21:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:21:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:21:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:21:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:21:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:21:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:21:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:21:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:21:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:21:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:21:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 00:21:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 00:21:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-07-14 00:21:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:21:45,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687112245] [2022-07-14 00:21:45,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687112245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:21:45,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:21:45,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:21:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952717335] [2022-07-14 00:21:45,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:21:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:21:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:21:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:21:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:21:45,670 INFO L87 Difference]: Start difference. First operand 22474 states and 32002 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-14 00:21:50,615 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-14 00:21:52,640 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-14 00:21:54,675 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-14 00:21:56,707 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-14 00:21:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:21:58,230 INFO L93 Difference]: Finished difference Result 47195 states and 68548 transitions. [2022-07-14 00:21:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:21:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 191 [2022-07-14 00:21:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:21:58,406 INFO L225 Difference]: With dead ends: 47195 [2022-07-14 00:21:58,406 INFO L226 Difference]: Without dead ends: 24655 [2022-07-14 00:21:58,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:21:58,453 INFO L413 NwaCegarLoop]: 1941 mSDtfsCounter, 2293 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 871 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 871 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:21:58,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 3878 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [871 Valid, 1281 Invalid, 4 Unknown, 0 Unchecked, 11.6s Time] [2022-07-14 00:21:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24655 states. [2022-07-14 00:21:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24655 to 22134. [2022-07-14 00:21:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22134 states, 16225 states have (on average 1.3691217257318953) internal successors, (22214), 16565 states have internal predecessors, (22214), 4566 states have call successors, (4566), 1267 states have call predecessors, (4566), 1342 states have return successors, (4712), 4586 states have call predecessors, (4712), 4565 states have call successors, (4712) [2022-07-14 00:21:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22134 states to 22134 states and 31492 transitions. [2022-07-14 00:21:59,267 INFO L78 Accepts]: Start accepts. Automaton has 22134 states and 31492 transitions. Word has length 191 [2022-07-14 00:21:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:21:59,268 INFO L495 AbstractCegarLoop]: Abstraction has 22134 states and 31492 transitions. [2022-07-14 00:21:59,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-14 00:21:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22134 states and 31492 transitions. [2022-07-14 00:21:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-14 00:21:59,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:21:59,304 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 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] [2022-07-14 00:21:59,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:21:59,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:21:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:21:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1431758578, now seen corresponding path program 1 times [2022-07-14 00:21:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:21:59,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400133799] [2022-07-14 00:21:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:21:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:21:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:21:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:21:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:21:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:21:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:21:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:21:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:21:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:21:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:21:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:21:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:21:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:21:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:21:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:21:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:21:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:21:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:21:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:21:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:21:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 00:21:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:21:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:21:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:21:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:21:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-14 00:21:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:21:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400133799] [2022-07-14 00:21:59,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400133799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:21:59,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:21:59,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:21:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128705063] [2022-07-14 00:21:59,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:21:59,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:21:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:21:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:21:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:21:59,842 INFO L87 Difference]: Start difference. First operand 22134 states and 31492 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 00:22:07,390 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-14 00:22:09,416 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-14 00:22:11,458 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-14 00:22:13,491 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-14 00:22:15,571 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-14 00:22:17,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-14 00:22:19,638 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-14 00:22:21,670 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-14 00:22:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:22:24,963 INFO L93 Difference]: Finished difference Result 70597 states and 103890 transitions. [2022-07-14 00:22:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:22:24,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 214 [2022-07-14 00:22:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:22:25,194 INFO L225 Difference]: With dead ends: 70597 [2022-07-14 00:22:25,195 INFO L226 Difference]: Without dead ends: 48569 [2022-07-14 00:22:25,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:22:25,281 INFO L413 NwaCegarLoop]: 3170 mSDtfsCounter, 2799 mSDsluCounter, 4214 mSDsCounter, 0 mSdLazyCounter, 3215 mSolverCounterSat, 1483 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 7384 SdHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1483 IncrementalHoareTripleChecker+Valid, 3215 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:22:25,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 7384 Invalid, 4706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1483 Valid, 3215 Invalid, 8 Unknown, 0 Unchecked, 23.2s Time] [2022-07-14 00:22:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48569 states. [2022-07-14 00:22:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48569 to 40160. [2022-07-14 00:22:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40160 states, 29370 states have (on average 1.3613891726251277) internal successors, (39984), 30009 states have internal predecessors, (39984), 8361 states have call successors, (8361), 2287 states have call predecessors, (8361), 2428 states have return successors, (8951), 8403 states have call predecessors, (8951), 8360 states have call successors, (8951) [2022-07-14 00:22:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40160 states to 40160 states and 57296 transitions. [2022-07-14 00:22:27,563 INFO L78 Accepts]: Start accepts. Automaton has 40160 states and 57296 transitions. Word has length 214 [2022-07-14 00:22:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:22:27,564 INFO L495 AbstractCegarLoop]: Abstraction has 40160 states and 57296 transitions. [2022-07-14 00:22:27,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 00:22:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 40160 states and 57296 transitions. [2022-07-14 00:22:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-14 00:22:27,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:22:27,620 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 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] [2022-07-14 00:22:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:22:27,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:22:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:22:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -434950096, now seen corresponding path program 1 times [2022-07-14 00:22:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:22:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678689118] [2022-07-14 00:22:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:22:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:22:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:22:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:22:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:22:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:22:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:22:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:22:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:22:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:22:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:22:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:22:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:22:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:22:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:22:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:22:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:22:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:22:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:22:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:22:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:22:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:22:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 00:22:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:22:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:22:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:22:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-14 00:22:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:22:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678689118] [2022-07-14 00:22:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678689118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:22:28,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:22:28,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:22:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822150720] [2022-07-14 00:22:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:22:28,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:22:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:22:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:22:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:22:28,319 INFO L87 Difference]: Start difference. First operand 40160 states and 57296 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-14 00:22:34,320 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-14 00:22:36,345 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-14 00:22:38,398 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-14 00:22:40,445 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-14 00:22:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:22:41,965 INFO L93 Difference]: Finished difference Result 44568 states and 66084 transitions. [2022-07-14 00:22:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:22:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 214 [2022-07-14 00:22:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:22:42,095 INFO L225 Difference]: With dead ends: 44568 [2022-07-14 00:22:42,095 INFO L226 Difference]: Without dead ends: 44560 [2022-07-14 00:22:42,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:22:42,116 INFO L413 NwaCegarLoop]: 1841 mSDtfsCounter, 875 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 995 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 4997 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 995 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:22:42,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 4997 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [995 Valid, 1828 Invalid, 4 Unknown, 0 Unchecked, 12.2s Time] [2022-07-14 00:22:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44560 states. [2022-07-14 00:22:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44560 to 40161. [2022-07-14 00:22:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40161 states, 29371 states have (on average 1.3613768683395187) internal successors, (39985), 30010 states have internal predecessors, (39985), 8361 states have call successors, (8361), 2287 states have call predecessors, (8361), 2428 states have return successors, (8951), 8403 states have call predecessors, (8951), 8360 states have call successors, (8951) [2022-07-14 00:22:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40161 states to 40161 states and 57297 transitions. [2022-07-14 00:22:43,755 INFO L78 Accepts]: Start accepts. Automaton has 40161 states and 57297 transitions. Word has length 214 [2022-07-14 00:22:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:22:43,756 INFO L495 AbstractCegarLoop]: Abstraction has 40161 states and 57297 transitions. [2022-07-14 00:22:43,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-14 00:22:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 40161 states and 57297 transitions. [2022-07-14 00:22:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-14 00:22:43,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:22:43,798 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 4, 4, 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] [2022-07-14 00:22:43,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 00:22:43,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:22:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:22:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2125567838, now seen corresponding path program 1 times [2022-07-14 00:22:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:22:43,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883222284] [2022-07-14 00:22:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:22:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:22:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:22:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:22:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:22:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:22:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:22:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:22:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:22:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:22:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:22:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:22:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:22:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:22:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:22:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 00:22:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:22:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:22:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:22:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:22:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:22:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:22:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 00:22:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:22:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:22:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:22:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-14 00:22:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:22:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883222284] [2022-07-14 00:22:44,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883222284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:22:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689980499] [2022-07-14 00:22:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:22:44,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:22:44,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:22:44,182 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-14 00:22:44,184 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-14 00:22:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:22:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 5387 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 00:22:45,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:22:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-14 00:22:45,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:22:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-14 00:22:45,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689980499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:22:45,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:22:45,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-14 00:22:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082308460] [2022-07-14 00:22:45,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:22:45,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:22:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:22:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:22:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:22:45,212 INFO L87 Difference]: Start difference. First operand 40161 states and 57297 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 7 states have internal predecessors, (126), 2 states have call successors, (41), 5 states have call predecessors, (41), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)