./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.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 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:00:01,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:00:01,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:00:01,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:00:01,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:00:01,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:00:01,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:00:01,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:00:01,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:00:01,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:00:01,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:00:01,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:00:01,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:00:01,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:00:01,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:00:01,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:00:01,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:00:01,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:00:01,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:00:01,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:00:01,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:00:01,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:00:01,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:00:01,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:00:01,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:00:01,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:00:01,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:00:01,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:00:01,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:00:01,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:00:01,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:00:01,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:00:01,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:00:01,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:00:01,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:00:01,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:00:01,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:00:01,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:00:01,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:00:01,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:00:01,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:00:01,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:00:01,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:00:01,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:00:01,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:00:01,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:00:01,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:00:01,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:00:01,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:00:01,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:00:01,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:00:01,968 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:00:01,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:00:01,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:00:01,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:00:01,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:00:01,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:00:01,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:00:01,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:00:01,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:00:01,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:00:01,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:00:01,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:00:01,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:00:01,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:00:01,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:00:01,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:00:01,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:00:01,973 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-07-12 13:00:02,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:00:02,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:00:02,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:00:02,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:00:02,255 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:00:02,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-12 13:00:02,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ead8c013/f6277d78ba43435f86c71b1f24708945/FLAG580514684 [2022-07-12 13:00:02,954 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:00:02,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-12 13:00:02,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ead8c013/f6277d78ba43435f86c71b1f24708945/FLAG580514684 [2022-07-12 13:00:03,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ead8c013/f6277d78ba43435f86c71b1f24708945 [2022-07-12 13:00:03,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:00:03,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:00:03,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:00:03,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:00:03,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:00:03,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:00:03" (1/1) ... [2022-07-12 13:00:03,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3aec51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:03, skipping insertion in model container [2022-07-12 13:00:03,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:00:03" (1/1) ... [2022-07-12 13:00:03,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:00:03,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:00:03,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-12 13:00:04,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:00:04,485 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:00:04,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-12 13:00:04,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:00:04,893 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:00:04,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04 WrapperNode [2022-07-12 13:00:04,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:00:04,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:00:04,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:00:04,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:00:04,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:04,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,143 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-07-12 13:00:05,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:00:05,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:00:05,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:00:05,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:00:05,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:00:05,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:00:05,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:00:05,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:00:05,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (1/1) ... [2022-07-12 13:00:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:00:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:00:05,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:00:05,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:00:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-12 13:00:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-12 13:00:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-12 13:00:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-12 13:00:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 13:00:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 13:00:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-12 13:00:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-12 13:00:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 13:00:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 13:00:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:00:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:00:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:00:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 13:00:05,399 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 13:00:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 13:00:05,399 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 13:00:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-12 13:00:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-12 13:00:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 13:00:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 13:00:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 13:00:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 13:00:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:00:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:00:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 13:00:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 13:00:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-12 13:00:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-12 13:00:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:00:05,401 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:00:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-12 13:00:05,402 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-12 13:00:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:00:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:00:05,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:00:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:00:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:00:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 13:00:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 13:00:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:00:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:00:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 13:00:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 13:00:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-12 13:00:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-12 13:00:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:00:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-12 13:00:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-12 13:00:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-12 13:00:05,405 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-12 13:00:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-12 13:00:05,405 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-12 13:00:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:00:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 13:00:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 13:00:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-12 13:00:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-12 13:00:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:00:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:00:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 13:00:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-12 13:00:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-12 13:00:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-12 13:00:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-12 13:00:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 13:00:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 13:00:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-12 13:00:05,409 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-12 13:00:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:00:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 13:00:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 13:00:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 13:00:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 13:00:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 13:00:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 13:00:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-12 13:00:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-12 13:00:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-12 13:00:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-12 13:00:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:00:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-12 13:00:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-12 13:00:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:00:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-12 13:00:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-12 13:00:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 13:00:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 13:00:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-12 13:00:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-12 13:00:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 13:00:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 13:00:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-12 13:00:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-12 13:00:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-12 13:00:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-12 13:00:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-12 13:00:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-12 13:00:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 13:00:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 13:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 13:00:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 13:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 13:00:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 13:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-12 13:00:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-12 13:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-12 13:00:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-12 13:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-12 13:00:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-12 13:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-12 13:00:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-12 13:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 13:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 13:00:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 13:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:00:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:00:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-12 13:00:05,420 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-12 13:00:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-12 13:00:05,420 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-12 13:00:05,944 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:00:05,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:00:06,201 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:00:08,218 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:00:08,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:00:08,237 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:00:08,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:00:08 BoogieIcfgContainer [2022-07-12 13:00:08,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:00:08,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:00:08,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:00:08,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:00:08,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:00:03" (1/3) ... [2022-07-12 13:00:08,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de3548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:00:08, skipping insertion in model container [2022-07-12 13:00:08,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:00:04" (2/3) ... [2022-07-12 13:00:08,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de3548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:00:08, skipping insertion in model container [2022-07-12 13:00:08,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:00:08" (3/3) ... [2022-07-12 13:00:08,254 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-12 13:00:08,265 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:00:08,265 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:00:08,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:00:08,342 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@75248301, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1290ef18 [2022-07-12 13:00:08,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:00:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-12 13:00:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 13:00:08,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:08,382 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:08,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-07-12 13:00:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736033566] [2022-07-12 13:00:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 13:00:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:08,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736033566] [2022-07-12 13:00:08,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736033566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:08,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:08,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:00:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44534801] [2022-07-12 13:00:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:08,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:00:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:08,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:00:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:00:08,848 INFO L87 Difference]: Start difference. First operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 13:00:11,207 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-12 13:00:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:13,398 INFO L93 Difference]: Finished difference Result 2928 states and 4383 transitions. [2022-07-12 13:00:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:00:13,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-12 13:00:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:13,426 INFO L225 Difference]: With dead ends: 2928 [2022-07-12 13:00:13,427 INFO L226 Difference]: Without dead ends: 1758 [2022-07-12 13:00:13,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:00:13,439 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 1444 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 500 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:13,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 3244 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1336 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 13:00:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-07-12 13:00:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1599. [2022-07-12 13:00:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.403225806451613) internal successors, (1653), 1211 states have internal predecessors, (1653), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-12 13:00:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2318 transitions. [2022-07-12 13:00:13,583 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2318 transitions. Word has length 63 [2022-07-12 13:00:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:13,584 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2318 transitions. [2022-07-12 13:00:13,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 13:00:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2318 transitions. [2022-07-12 13:00:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 13:00:13,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00: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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:00:13,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-07-12 13:00:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975535000] [2022-07-12 13:00:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 13:00:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 13:00:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 13:00:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:13,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975535000] [2022-07-12 13:00:13,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975535000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:13,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:13,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:00:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134315114] [2022-07-12 13:00:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:13,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:00:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:00:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:00:13,828 INFO L87 Difference]: Start difference. First operand 1599 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 13:00:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:16,011 INFO L93 Difference]: Finished difference Result 3364 states and 4935 transitions. [2022-07-12 13:00:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:00:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-12 13:00:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:16,022 INFO L225 Difference]: With dead ends: 3364 [2022-07-12 13:00:16,022 INFO L226 Difference]: Without dead ends: 1789 [2022-07-12 13:00:16,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:00:16,028 INFO L413 NwaCegarLoop]: 1474 mSDtfsCounter, 1824 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:16,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 2562 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 13:00:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-12 13:00:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-12 13:00:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.401528013582343) internal successors, (1651), 1211 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-12 13:00:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2316 transitions. [2022-07-12 13:00:16,112 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2316 transitions. Word has length 104 [2022-07-12 13:00:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:16,114 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2316 transitions. [2022-07-12 13:00:16,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 13:00:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2316 transitions. [2022-07-12 13:00:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 13:00:16,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:16,120 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:16,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:00:16,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-07-12 13:00:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:16,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969644452] [2022-07-12 13:00:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 13:00:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 13:00:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 13:00:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:16,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969644452] [2022-07-12 13:00:16,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969644452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:16,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:16,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:00:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357037201] [2022-07-12 13:00:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:00:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:00:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:00:16,332 INFO L87 Difference]: Start difference. First operand 1599 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 13:00:18,469 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-12 13:00:20,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:00:23,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:00:25,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:00:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:27,066 INFO L93 Difference]: Finished difference Result 3368 states and 4935 transitions. [2022-07-12 13:00:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:00:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-07-12 13:00:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:27,077 INFO L225 Difference]: With dead ends: 3368 [2022-07-12 13:00:27,077 INFO L226 Difference]: Without dead ends: 1789 [2022-07-12 13:00:27,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:00:27,083 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 558 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 257 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:27,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 4370 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2224 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2022-07-12 13:00:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-12 13:00:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-12 13:00:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.399830220713073) internal successors, (1649), 1211 states have internal predecessors, (1649), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-12 13:00:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2314 transitions. [2022-07-12 13:00:27,143 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2314 transitions. Word has length 104 [2022-07-12 13:00:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:27,144 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2314 transitions. [2022-07-12 13:00:27,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 13:00:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2314 transitions. [2022-07-12 13:00:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 13:00:27,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:27,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:27,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:00:27,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-07-12 13:00:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:27,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456527577] [2022-07-12 13:00:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:00:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:00:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:27,328 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-12 13:00:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456527577] [2022-07-12 13:00:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456527577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:27,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:00:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495713202] [2022-07-12 13:00:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:27,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:00:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:00:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:00:27,333 INFO L87 Difference]: Start difference. First operand 1599 states and 2314 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 13:00:29,724 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-12 13:00:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:32,201 INFO L93 Difference]: Finished difference Result 2380 states and 3634 transitions. [2022-07-12 13:00:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:00:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-07-12 13:00:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:32,216 INFO L225 Difference]: With dead ends: 2380 [2022-07-12 13:00:32,216 INFO L226 Difference]: Without dead ends: 2377 [2022-07-12 13:00:32,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:00:32,220 INFO L413 NwaCegarLoop]: 2080 mSDtfsCounter, 1807 mSDsluCounter, 3118 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 732 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 5198 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:32,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 5198 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2092 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 13:00:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-12 13:00:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1601. [2022-07-12 13:00:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.3991525423728814) internal successors, (1651), 1213 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-12 13:00:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2316 transitions. [2022-07-12 13:00:32,304 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2316 transitions. Word has length 107 [2022-07-12 13:00:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:32,304 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2316 transitions. [2022-07-12 13:00:32,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 13:00:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2316 transitions. [2022-07-12 13:00:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 13:00:32,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:32,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:32,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:00:32,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash 578773151, now seen corresponding path program 1 times [2022-07-12 13:00:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:32,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885574662] [2022-07-12 13:00:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:00:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:00:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:00:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:32,551 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-12 13:00:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:32,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885574662] [2022-07-12 13:00:32,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885574662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:32,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:32,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:00:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220164074] [2022-07-12 13:00:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:32,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:00:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:32,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:00:32,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:00:32,555 INFO L87 Difference]: Start difference. First operand 1601 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:00:34,738 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-12 13:00:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:38,476 INFO L93 Difference]: Finished difference Result 3957 states and 5919 transitions. [2022-07-12 13:00:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:00:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-07-12 13:00:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:38,491 INFO L225 Difference]: With dead ends: 3957 [2022-07-12 13:00:38,491 INFO L226 Difference]: Without dead ends: 2380 [2022-07-12 13:00:38,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:00:38,497 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 2450 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 733 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:38,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 4164 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 2131 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 13:00:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-12 13:00:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1602. [2022-07-12 13:00:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1181 states have (on average 1.3988145639288738) internal successors, (1652), 1214 states have internal predecessors, (1652), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-12 13:00:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2317 transitions. [2022-07-12 13:00:38,589 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2317 transitions. Word has length 117 [2022-07-12 13:00:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:38,591 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2317 transitions. [2022-07-12 13:00:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:00:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2317 transitions. [2022-07-12 13:00:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 13:00:38,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:38,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:00:38,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:00:38,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1349496606, now seen corresponding path program 1 times [2022-07-12 13:00:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:38,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20950153] [2022-07-12 13:00:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:00:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:00:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:00:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:38,812 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-12 13:00:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:38,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20950153] [2022-07-12 13:00:38,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20950153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:38,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:38,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:00:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551821961] [2022-07-12 13:00:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:00:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:00:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:00:38,814 INFO L87 Difference]: Start difference. First operand 1602 states and 2317 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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-12 13:00:43,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:00:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:47,216 INFO L93 Difference]: Finished difference Result 3312 states and 5203 transitions. [2022-07-12 13:00:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 13:00:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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 119 [2022-07-12 13:00:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:47,234 INFO L225 Difference]: With dead ends: 3312 [2022-07-12 13:00:47,234 INFO L226 Difference]: Without dead ends: 3309 [2022-07-12 13:00:47,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:00:47,237 INFO L413 NwaCegarLoop]: 2517 mSDtfsCounter, 2306 mSDsluCounter, 6388 mSDsCounter, 0 mSdLazyCounter, 3816 mSolverCounterSat, 811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 8905 SdHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 811 IncrementalHoareTripleChecker+Valid, 3816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:47,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 8905 Invalid, 4627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [811 Valid, 3816 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-12 13:00:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2022-07-12 13:00:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1604. [2022-07-12 13:00:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.398477157360406) internal successors, (1653), 1214 states have internal predecessors, (1653), 334 states have call successors, (334), 89 states have call predecessors, (334), 87 states have return successors, (333), 329 states have call predecessors, (333), 333 states have call successors, (333) [2022-07-12 13:00:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2022-07-12 13:00:47,340 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 119 [2022-07-12 13:00:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:47,341 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2022-07-12 13:00:47,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 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-12 13:00:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2022-07-12 13:00:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 13:00:47,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:47,349 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:00:47,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:00:47,349 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335849, now seen corresponding path program 1 times [2022-07-12 13:00:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238761313] [2022-07-12 13:00:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:00:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:00:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:00:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 13:00:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 13:00:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 13:00:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 13:00:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-12 13:00:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:47,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238761313] [2022-07-12 13:00:47,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238761313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:47,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:47,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:00:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431792158] [2022-07-12 13:00:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:47,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:00:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:00:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:00:47,611 INFO L87 Difference]: Start difference. First operand 1604 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 13:00:49,755 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-12 13:00:53,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:00:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:55,377 INFO L93 Difference]: Finished difference Result 3997 states and 5840 transitions. [2022-07-12 13:00:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:00:55,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2022-07-12 13:00:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:55,389 INFO L225 Difference]: With dead ends: 3997 [2022-07-12 13:00:55,389 INFO L226 Difference]: Without dead ends: 2417 [2022-07-12 13:00:55,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:00:55,396 INFO L413 NwaCegarLoop]: 2204 mSDtfsCounter, 2304 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 886 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:55,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3561 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 1147 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-07-12 13:00:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-07-12 13:00:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2144. [2022-07-12 13:00:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1571 states have (on average 1.3908338637810311) internal successors, (2185), 1612 states have internal predecessors, (2185), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:00:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3080 transitions. [2022-07-12 13:00:55,532 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3080 transitions. Word has length 149 [2022-07-12 13:00:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:00:55,532 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 3080 transitions. [2022-07-12 13:00:55,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 13:00:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3080 transitions. [2022-07-12 13:00:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 13:00:55,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:00:55,543 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:00:55,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:00:55,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:00:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:00:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 178046639, now seen corresponding path program 1 times [2022-07-12 13:00:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:00:55,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455321032] [2022-07-12 13:00:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:00:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:00:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:00:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:00:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:00:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:00:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:00:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:00:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:00:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:00:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:00:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:00:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:00:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:00:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 13:00:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 13:00:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 13:00:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 13:00:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:00:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 13:00:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:00:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455321032] [2022-07-12 13:00:55,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455321032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:00:55,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:00:55,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:00:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066574739] [2022-07-12 13:00:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:00:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:00:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:00:55,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:00:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:00:55,792 INFO L87 Difference]: Start difference. First operand 2144 states and 3080 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 13:00:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:00:59,871 INFO L93 Difference]: Finished difference Result 4586 states and 6826 transitions. [2022-07-12 13:00:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:00:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2022-07-12 13:00:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:00:59,888 INFO L225 Difference]: With dead ends: 4586 [2022-07-12 13:00:59,888 INFO L226 Difference]: Without dead ends: 3006 [2022-07-12 13:00:59,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:00:59,894 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 2750 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3003 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 13:00:59,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3003 Valid, 3731 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 13:00:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-12 13:01:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2148. [2022-07-12 13:01:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3904761904761904) internal successors, (2190), 1616 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:01:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3085 transitions. [2022-07-12 13:01:00,047 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3085 transitions. Word has length 151 [2022-07-12 13:01:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:00,048 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3085 transitions. [2022-07-12 13:01:00,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 13:01:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3085 transitions. [2022-07-12 13:01:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 13:01:00,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:00,059 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:01:00,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:01:00,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1182989250, now seen corresponding path program 1 times [2022-07-12 13:01:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:00,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55240071] [2022-07-12 13:01:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 13:01:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 13:01:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 13:01:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 13:01:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 13:01:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:00,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55240071] [2022-07-12 13:01:00,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55240071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:01:00,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:01:00,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:01:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931503449] [2022-07-12 13:01:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:01:00,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:01:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:01:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:01:00,234 INFO L87 Difference]: Start difference. First operand 2148 states and 3085 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:01:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:03,682 INFO L93 Difference]: Finished difference Result 4546 states and 6642 transitions. [2022-07-12 13:01:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:01:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2022-07-12 13:01:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:03,694 INFO L225 Difference]: With dead ends: 4546 [2022-07-12 13:01:03,694 INFO L226 Difference]: Without dead ends: 2422 [2022-07-12 13:01:03,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:01:03,703 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 551 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:03,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3476 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 13:01:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-07-12 13:01:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2148. [2022-07-12 13:01:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3847619047619049) internal successors, (2181), 1616 states have internal predecessors, (2181), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:01:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3076 transitions. [2022-07-12 13:01:03,857 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3076 transitions. Word has length 154 [2022-07-12 13:01:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3076 transitions. [2022-07-12 13:01:03,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:01:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3076 transitions. [2022-07-12 13:01:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 13:01:03,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:03,869 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:01:03,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:01:03,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1835092685, now seen corresponding path program 1 times [2022-07-12 13:01:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:03,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751174560] [2022-07-12 13:01:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 13:01:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 13:01:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 13:01:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:01:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 13:01:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:04,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751174560] [2022-07-12 13:01:04,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751174560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895902943] [2022-07-12 13:01:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:01:04,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:01:04,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:01:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:04,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:01:04,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:01:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 13:01:04,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:01:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 13:01:04,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895902943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:01:04,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:01:04,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-12 13:01:04,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929636759] [2022-07-12 13:01:04,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:01:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 13:01:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 13:01:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:01:04,966 INFO L87 Difference]: Start difference. First operand 2148 states and 3076 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-12 13:01:08,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:01:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:12,304 INFO L93 Difference]: Finished difference Result 6340 states and 9749 transitions. [2022-07-12 13:01:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:01:12,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 157 [2022-07-12 13:01:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:12,326 INFO L225 Difference]: With dead ends: 6340 [2022-07-12 13:01:12,326 INFO L226 Difference]: Without dead ends: 4756 [2022-07-12 13:01:12,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:01:12,332 INFO L413 NwaCegarLoop]: 2670 mSDtfsCounter, 5998 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 4008 mSolverCounterSat, 2164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 6983 SdHoareTripleChecker+Invalid, 6172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2164 IncrementalHoareTripleChecker+Valid, 4008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:12,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 6983 Invalid, 6172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2164 Valid, 4008 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 13:01:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2022-07-12 13:01:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2155. [2022-07-12 13:01:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1582 states have (on average 1.384323640960809) internal successors, (2190), 1623 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:01:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3085 transitions. [2022-07-12 13:01:12,511 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3085 transitions. Word has length 157 [2022-07-12 13:01:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:12,512 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 3085 transitions. [2022-07-12 13:01:12,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-12 13:01:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3085 transitions. [2022-07-12 13:01:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 13:01:12,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:12,523 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:01:12,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 13:01:12,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 13:01:12,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1991118289, now seen corresponding path program 1 times [2022-07-12 13:01:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:12,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870087161] [2022-07-12 13:01:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:01:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 13:01:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:01:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 13:01:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 13:01:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-12 13:01:13,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:13,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870087161] [2022-07-12 13:01:13,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870087161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:13,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853958072] [2022-07-12 13:01:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:13,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:01:13,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:01:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:01:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:13,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 13:01:13,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:01:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 13:01:13,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:01:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853958072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:01:13,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:01:13,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-07-12 13:01:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824939840] [2022-07-12 13:01:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:01:13,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:01:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:01:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 13:01:13,695 INFO L87 Difference]: Start difference. First operand 2155 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 13:01:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:14,147 INFO L93 Difference]: Finished difference Result 4676 states and 6864 transitions. [2022-07-12 13:01:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:01:14,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2022-07-12 13:01:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:14,172 INFO L225 Difference]: With dead ends: 4676 [2022-07-12 13:01:14,172 INFO L226 Difference]: Without dead ends: 3085 [2022-07-12 13:01:14,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:01:14,179 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 926 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:14,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 5794 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:01:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-07-12 13:01:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2157. [2022-07-12 13:01:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 1584 states have (on average 1.3838383838383839) internal successors, (2192), 1625 states have internal predecessors, (2192), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:01:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3087 transitions. [2022-07-12 13:01:14,355 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3087 transitions. Word has length 166 [2022-07-12 13:01:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:14,356 INFO L495 AbstractCegarLoop]: Abstraction has 2157 states and 3087 transitions. [2022-07-12 13:01:14,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 13:01:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3087 transitions. [2022-07-12 13:01:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 13:01:14,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:14,365 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:01:14,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 13:01:14,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 13:01:14,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -530211425, now seen corresponding path program 1 times [2022-07-12 13:01:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110115608] [2022-07-12 13:01:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:01:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:01:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 13:01:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:01:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 13:01:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 13:01:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 13:01:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-12 13:01:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:14,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110115608] [2022-07-12 13:01:14,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110115608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:01:14,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:01:14,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:01:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405012266] [2022-07-12 13:01:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:01:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:01:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:01:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:01:14,775 INFO L87 Difference]: Start difference. First operand 2157 states and 3087 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 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-12 13:01:17,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:01:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:20,472 INFO L93 Difference]: Finished difference Result 4652 states and 6903 transitions. [2022-07-12 13:01:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:01:20,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 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 175 [2022-07-12 13:01:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:20,483 INFO L225 Difference]: With dead ends: 4652 [2022-07-12 13:01:20,483 INFO L226 Difference]: Without dead ends: 3059 [2022-07-12 13:01:20,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:01:20,489 INFO L413 NwaCegarLoop]: 1982 mSDtfsCounter, 1543 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:20,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 5110 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 13:01:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2022-07-12 13:01:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2159. [2022-07-12 13:01:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1586 states have (on average 1.3833543505674653) internal successors, (2194), 1627 states have internal predecessors, (2194), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-12 13:01:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3089 transitions. [2022-07-12 13:01:20,660 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3089 transitions. Word has length 175 [2022-07-12 13:01:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:20,660 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 3089 transitions. [2022-07-12 13:01:20,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 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-12 13:01:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3089 transitions. [2022-07-12 13:01:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 13:01:20,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:20,670 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-12 13:01:20,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 13:01:20,670 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1482100280, now seen corresponding path program 1 times [2022-07-12 13:01:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:20,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095666919] [2022-07-12 13:01:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:20,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:01:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 13:01:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 13:01:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 13:01:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 13:01:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:01:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 13:01:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 13:01:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 13:01:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095666919] [2022-07-12 13:01:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095666919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995844282] [2022-07-12 13:01:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:21,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:21,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:01:21,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:01:21,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:01:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:21,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 13:01:21,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:01:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-12 13:01:21,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:01:21,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995844282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:01:21,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:01:21,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-07-12 13:01:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974057177] [2022-07-12 13:01:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:01:21,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:01:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:01:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 13:01:21,877 INFO L87 Difference]: Start difference. First operand 2159 states and 3089 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 13:01:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:22,337 INFO L93 Difference]: Finished difference Result 4849 states and 7125 transitions. [2022-07-12 13:01:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:01:22,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 183 [2022-07-12 13:01:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:22,348 INFO L225 Difference]: With dead ends: 4849 [2022-07-12 13:01:22,348 INFO L226 Difference]: Without dead ends: 3254 [2022-07-12 13:01:22,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 13:01:22,354 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 1174 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 10631 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:22,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 10631 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:01:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-12 13:01:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2164. [2022-07-12 13:01:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1590 states have (on average 1.3823899371069182) internal successors, (2198), 1631 states have internal predecessors, (2198), 448 states have call successors, (448), 126 states have call predecessors, (448), 125 states have return successors, (451), 442 states have call predecessors, (451), 447 states have call successors, (451) [2022-07-12 13:01:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3097 transitions. [2022-07-12 13:01:22,532 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3097 transitions. Word has length 183 [2022-07-12 13:01:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:22,532 INFO L495 AbstractCegarLoop]: Abstraction has 2164 states and 3097 transitions. [2022-07-12 13:01:22,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 13:01:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3097 transitions. [2022-07-12 13:01:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 13:01:22,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:22,542 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-12 13:01:22,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:01:22,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:22,768 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 503652149, now seen corresponding path program 1 times [2022-07-12 13:01:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:22,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875584264] [2022-07-12 13:01:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 13:01:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 13:01:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 13:01:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:01:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:01:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 13:01:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 13:01:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 13:01:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 13:01:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:01:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 13:01:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 13:01:23,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875584264] [2022-07-12 13:01:23,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875584264] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589257564] [2022-07-12 13:01:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:01:23,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:01:23,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:01:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:23,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-12 13:01:23,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:01:24,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:24,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:24,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 13:01:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:24,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:24,543 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 13:01:24,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:01:24,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:01:24,760 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-12 13:01:24,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:01:24,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-12 13:01:24,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:24,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-12 13:01:24,987 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-12 13:01:24,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 13:01:24,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 13:01:25,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-12 13:01:25,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-12 13:01:25,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 13:01:25,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:01:25,155 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-12 13:01:25,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2022-07-12 13:01:25,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 13:01:25,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:01:25,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 13:01:25,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:01:25,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 13:01:25,430 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-12 13:01:25,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:01:25,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:01:25,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:25,738 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-12 13:01:25,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:01:25,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:01:25,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:25,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:26,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:26,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:26,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-07-12 13:01:26,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:26,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-07-12 13:01:26,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:26,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 13:01:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 13:01:26,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:01:26,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_832) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_830) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-12 13:01:26,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589257564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:26,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:01:26,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 40 [2022-07-12 13:01:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001458585] [2022-07-12 13:01:26,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:01:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 13:01:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 13:01:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1441, Unknown=1, NotChecked=76, Total=1640 [2022-07-12 13:01:26,333 INFO L87 Difference]: Start difference. First operand 2164 states and 3097 transitions. Second operand has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 13:01:29,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:01:34,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:01:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:01:48,148 INFO L93 Difference]: Finished difference Result 5266 states and 7930 transitions. [2022-07-12 13:01:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 13:01:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) Word has length 189 [2022-07-12 13:01:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:01:48,162 INFO L225 Difference]: With dead ends: 5266 [2022-07-12 13:01:48,162 INFO L226 Difference]: Without dead ends: 3645 [2022-07-12 13:01:48,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 205 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=4278, Unknown=1, NotChecked=134, Total=4830 [2022-07-12 13:01:48,171 INFO L413 NwaCegarLoop]: 2374 mSDtfsCounter, 5190 mSDsluCounter, 22009 mSDsCounter, 0 mSdLazyCounter, 24996 mSolverCounterSat, 2802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5368 SdHoareTripleChecker+Valid, 24383 SdHoareTripleChecker+Invalid, 30255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2802 IncrementalHoareTripleChecker+Valid, 24996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2457 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:01:48,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5368 Valid, 24383 Invalid, 30255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2802 Valid, 24996 Invalid, 0 Unknown, 2457 Unchecked, 20.5s Time] [2022-07-12 13:01:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-07-12 13:01:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2180. [2022-07-12 13:01:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1644 states have internal predecessors, (2209), 448 states have call successors, (448), 126 states have call predecessors, (448), 130 states have return successors, (465), 445 states have call predecessors, (465), 447 states have call successors, (465) [2022-07-12 13:01:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3122 transitions. [2022-07-12 13:01:48,412 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3122 transitions. Word has length 189 [2022-07-12 13:01:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:01:48,412 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3122 transitions. [2022-07-12 13:01:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 13:01:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3122 transitions. [2022-07-12 13:01:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 13:01:48,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:01:48,422 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:01:48,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:01:48,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:48,648 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:01:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:01:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1115474398, now seen corresponding path program 1 times [2022-07-12 13:01:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:01:48,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291881017] [2022-07-12 13:01:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:01:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 13:01:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:01:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:01:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 13:01:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:01:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 13:01:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:01:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:01:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 13:01:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 13:01:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 13:01:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 13:01:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:01:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 13:01:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 13:01:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 13:01:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 13:01:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 13:01:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 13:01:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 13:01:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-12 13:01:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:01:50,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291881017] [2022-07-12 13:01:50,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291881017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:50,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425587249] [2022-07-12 13:01:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:01:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:01:50,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:01:50,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:01:50,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 13:01:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:01:51,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-12 13:01:51,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:01:51,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:01:51,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:01:51,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:01:52,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:52,134 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-12 13:01:52,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 30 [2022-07-12 13:01:52,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:01:52,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 13:01:52,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 13:01:52,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:53,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 13:01:53,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:01:53,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:01:53,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:53,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:01:53,542 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-12 13:01:53,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:01:53,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-12 13:01:53,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-12 13:01:53,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 13:01:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-12 13:01:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:53,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-12 13:01:53,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:01:53,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 13:01:53,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 13:01:54,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:01:54,087 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 13:01:54,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 13:01:54,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:01:54,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-12 13:01:54,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 13:01:54,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 13:01:54,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-12 13:01:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:54,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:01:54,843 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 13:01:54,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:01:54,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:01:54,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:54,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-12 13:01:55,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:55,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 13:01:55,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:55,573 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 13:01:55,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-07-12 13:01:55,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:01:55,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 13:01:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 13:01:55,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:01:55,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1105) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1107) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1106) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-12 13:01:55,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425587249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:01:55,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:01:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-07-12 13:01:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950606649] [2022-07-12 13:01:55,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:01:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-12 13:01:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:01:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-12 13:01:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4355, Unknown=1, NotChecked=132, Total=4692 [2022-07-12 13:01:55,632 INFO L87 Difference]: Start difference. First operand 2180 states and 3122 transitions. Second operand has 68 states, 66 states have (on average 3.515151515151515) internal successors, (232), 54 states have internal predecessors, (232), 22 states have call successors, (45), 13 states have call predecessors, (45), 17 states have return successors, (37), 25 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-12 13:01:58,979 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-12 13:02:01,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:03,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:05,226 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-12 13:02:07,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:09,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:11,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:13,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:15,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:17,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:19,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:21,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:23,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:26,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:28,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:30,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:32,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:34,381 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-12 13:02:36,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:40,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:44,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:47,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:49,094 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-12 13:02:51,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:02:53,279 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-12 13:02:59,229 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-12 13:03:01,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:03,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:05,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:07,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:09,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:11,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:13,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:15,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:17,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:19,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:22,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:24,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:26,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:28,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:30,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:32,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:34,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:36,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:38,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:40,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:42,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:45,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:47,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:49,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:51,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:53,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:03:55,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:01,133 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-12 13:04:03,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:05,304 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-12 13:04:07,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []